Polynomial size Ω-branching programs and their computational power
- 1 April 1990
- journal article
- Published by Elsevier in Information and Computation
- Vol. 85 (2) , 163-182
- https://doi.org/10.1016/0890-5401(90)90046-k
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- On the construction of parallel computers from various bases of boolean functionsTheoretical Computer Science, 1986
- Constant Depth ReducibilitySIAM Journal on Computing, 1984
- AlternationJournal of the ACM, 1981
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970
- The recognition problem for the set of perfect squaresPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1966
- Introduction to a General Theory of Elementary PropositionsAmerican Journal of Mathematics, 1921