Affiliation:
1. Univ. of Edinburgh, Edinburgh, Scotland
Abstract
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference24 articles.
1. relating time and space to size and depth;BORODIN A.B.;SIAM J. Comput.,1977
2. parallel matrix inversion algorithms;CSANKY L.;SlAM J. Comput.,1976
Cited by
61 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Guest Column;ACM SIGACT News;2023-02-28
2. A Bivariate Invariance Principle;2022 IEEE Information Theory Workshop (ITW);2022-11-01
3. Refinements of Approximation Results of Conditional Restricted Boltzmann Machines;IEEE Transactions on Neural Networks and Learning Systems;2021
4. 3D Crosspoint Memory as a Parallel Architecture for Computing Network Reachability;2018 IEEE 36th International Conference on Computer Design (ICCD);2018-10
5. Brief Announcement;Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures;2018-07-11