On the construction of parallel computers from various bases of boolean functions

Aho, 1974 Chandra, 1981, Alternation, J. ACM, 28, 114, 10.1145/322234.322243 Cook, 1971, The complexity of theorem proving procedures, 148 Garey, 1979 Goldschlager, 1977, The monotone and planar circuit value problems are log space complete for P, SIGACT News, 9, 25, 10.1145/1008354.1008356 Goldschlager, 1980, A space efficient algorithm for the monotone planar circuit value problem, Inform. Process. Lett., 10, 25, 10.1016/0020-0190(80)90117-9 Goldschlager, 1982, A universal interconnection pattern for parallel computers, J. ACM, 29, 1073, 10.1145/322344.322353 Goldschlager, 1983, A characterization of sets of n-input gates in terms of their computational power Jones, 1977, Complete problems for deterministic polynomial time, Theoret. Comput. Sci., 3, 105, 10.1016/0304-3975(76)90068-2 Kamimura, 1980, Some results on pseudopolynomial algorithms Karp, 1972, Reducibility among combinatorial problems Ladner, 1975, The circuit value problem is log space complete for P, SIGACT News, 7, 18, 10.1145/990518.990519 Luks, 1980, Isomorphism of graphs of bounded valence can be tested in polynomial time, 42 Savage, 1972, Computational work and time on finite machines, J. ACM, 19, 660, 10.1145/321724.321731 Valiant, 1979, The complexity of enumeration and reliability problems, SIAM J. Comput., 8, 410, 10.1137/0208032