Theoretical analysis demonstrates that Boolean function projections replicate core Turing complexity results, indicating a simpler framework for fine-grained problem classification.
A projection of a Boolean function is a function obtained by substituting for each of its variables a variable, the negation of a variable, or a constant. Reducibilities among computational problems under this relation of projection are considered. It is shown that much of what is of everyday relevance in Turing-machine-based complexity theory can be replicated easily and naturally in this elementary framework. Finer distinctions about the computational relationships among natural problems can be made than in previous formulations and some negative results are proved.
No takes yet. Share an insight, caveat, or question.
Skyum et al. (1981) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: