On the construction of parallel computers from various bases of boolean functions
Open Access
- 31 December 1986
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 43, 43-58
- https://doi.org/10.1016/0304-3975(86)90165-9
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A universal interconnection pattern for parallel computersJournal of the ACM, 1982
- AlternationJournal of the ACM, 1981
- A space efficient algorithm for the monotone planar circuit value problemInformation Processing Letters, 1980
- The Complexity of Enumeration and Reliability ProblemsSIAM Journal on Computing, 1979
- The monotone and planar circuit value problems are log space complete for PACM SIGACT News, 1977
- Complete problems for deterministic polynomial timeTheoretical Computer Science, 1976
- The circuit value problem is log space complete for PACM SIGACT News, 1975
- Computational Work and Time on Finite MachinesJournal of the ACM, 1972