Expressing uniformity via oracles

Theory of Computing Systems

Volumn 30, Issue 4, 1997, Pages 355-366

  Damm, C ^a   Holzer, M ^b   Rossmanith, P ^b  

^a UNIVERSITY OF TRIER   (Germany)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CHARACTERIZATION; COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION;

BOOLEAN CIRCUIT; COMPLEXITY CLASS; COMPUTATIONAL POWER; DLOGTIME-UNIFORM CIRCUITS; ORACLE ACCESS; POLYNOMIAL-TIME; UNIFORM CIRCUITS;

ELECTRIC NETWORK ANALYSIS;

EID: 0031496417     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/BF02679465     Document Type: Article

References (14)

1. E. W. Allender. P-uniform circuit complexity. Journal of the Association for Computing Machinery, 36(4):912-928, October 1989.
2. 1. Journal of Computer and System Sciences, 41:274-306, 1990.
3. P. W. Beame, S. A. Cook, and H. J. Hoover. Log depth circuits for division and related problems. SIAM Journal on Computing, 15:994-1003, 1986.
4. R. V. Book. Comparing complexity classes. Journal of Computer and System Sciences, 9:213-229, 1974.
5. R. V. Book, C. Wrathall, A. L. Selman, and D. Dobkin. Inclusion complete tally languages and the Hartmanis-Berman conjecture. Mathematical Systems Theory, 11:1-8, 1977.
6. A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer. Alternation. Journal of the ACM, 28(1):114-133, 1981
7. S. A. Cook. A taxonomy of problems with fast parallel algorithms. Information and Control, 64:2-22, 1985.
8. J. Hartmanis and S. Mahaney. Languages simultaneously complete for one-way and two-way log-tape automata. SIAM Journal on Computing, 10(2):383-390, 1981.
9. B. Jenner and B. Kirsig. Alternierung und Logarithmischer Platz. Dissertation (in German), Universität Hamburg, 1989.
10. M. Li and P. M. B. Vitányi. An Introduction to Kolmogorov Complexity and Its Applications. Springer-Verlag, New York, 1993.
11. W. L. Ruzzo. Tree-size bounded alternation. Journal of Computer and System Sciences, 21(2):218-235, 1980.
12. W. L. Ruzzo. On uniform circuit complexity. Journal of Computer and System Sciences, 22(3):365-383, 1981.
13. W. J. Savitch. A note on multihead automata and context-sensitive languages. Acta Informatica, 2:249-252, 1973.
14. C. B. Wilson. Relativized circuit complexity. Journal of Computer and System Sciences; 31:169-181, 1985.