Publisher
Springer Science and Business Media LLC
Subject
General Computer Science,General Computer Science
Reference17 articles.
1. L. Stockmeyer and U. Vishkin, ?Simulation of parallel random access machines by circuits,? SIAM J. Comput.,13, No. 2, 409?422 (1984).
2. O. B. Lupanov, ?On methods of constructing complexity bounds and computation of individual functions,? Diskretnyi Analiz,25, 3?18 (1974).
3. S. Cook, ?The classification of problems which have fast parallel algorithms,? Lect. Notes Comput. Sci.,158, 78?93 (1983).
4. K. Chandra, L. Stockmeyer, and U. Vishkin, ?Constant depth reducibility,? SIAM J. Comput.,13, No. 2, 423?439 (1984).
5. S. Skyum and L. Valiant, ?A complexity theory based on Boolean algebra,? in: 22nd Annual Symp. on Foundations of Computer Science, New York (1981), pp. 244?253.