On balanced versus unbalanced computation trees

Theory of Computing Systems

Volumn 29, Issue 4, 1996, Pages 411-421

  Hertrampf, U ^a   Vollmer, H ^a   Wagner, K W ^a  

^a UNIVERSITY OF WÜRZBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION; POLYNOMIALS;

BALANCED TREES; COMPLEXITY CLASS; COMPLEXITY THEORY; COMPUTATION TREES; LEAF-LANGUAGE CLASS; LOGARITHMIC TIME; NONDETERMINISTIC POLYNOMIAL; POLYNOMIAL-TIME HIERARCHY;

FORESTRY;

EID: 0010617502     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/BF01192696     Document Type: Article

References (17)

1. J. L. Balcázar, J. Díaz, J. Gabarró, Structural Complexity I; Springer-Verlag, Berlin, 1988.
2. J. L. Balcázar, J. Díaz, J. Gabarró, Structural Complexity II; Springer-Verlag, Berlin, 1990.
3. D. P. Bovet, P. Crescenzi, R. Silvestri, Complexity classes and sparse oracles; Proceedings of the 6th Structure in Complexity Theory Conference (1991), pp. 102-108.
4. D. P. Bovet, P. Crescenzi, R. Silvestri, A uniform approach to define complexity classes; Theoretical Computer Science 104 (1992), 263-283.
5. A. K. Chandra, D. C. Kozen, L. J. Stockmeyer, Alternation; Journal of the ACM 28 (1981), 114-133.
6. J. Gill, Computational complexity of probabilistic complexity classes; SIAM Journal on Computing 6 (1977), 675-695.
7. Y. Han, L. Hemachandra, T. Thierauf, Threshold computation and cryptographic security; Proceedings of the 4th International Symposium on Algorithms and Computation (1993), LNCS 762, pp. 230-239.
8. U. Hertrampf, Locally definable acceptance types-the three valued case; Proceedings of the 1st Latin American Symposium on Theoretical Informatics (1992), LNCS 583, pp. 262-271.
9. U. Hertrampf, Locally definable acceptance types for polynomial time machines; Proceedings of the 9th Symposium on Theoretical Aspects of Computer Science (1992), LNCS 577, pp. 199-207.
10. U. Hertrampf, Complexity classes defined via k-valued functions; Proceedings of the 9th Structure in Complexity Theory Conference (1994), pp. 224-234.
11. U. Hertrampf, Über Komplexitätsklassen, die mit Hilfe k-wertiger Funktionen definiert werden; Habilitationsschrift, Universität Würzburg, 1994.
12. U. Hertrampf, C. Lautemann, T. Schwentick, H. Vollmer, K. W. Wagner, On the power of polynomial time bit-reductions; Proceedings of the 8th Structure in Complexity Theory Conference (1993), pp. 200-207.
13. J. E. Hopcroft, J. D. oilman, Introduction to Automata Theory, Languages, and Computation; Addison-Wesley, Reading, MA, 1979.
14. B. Jenner, P. McKenzie, D. Thérien, Logspace and logtime leaf languages; Proceedings of the 9th Structure in Complexity Theory Conference (1994), pp. 242-254.
15. J. Simon, On some central problems in computational complexity; Ph.D. Thesis, Cornell University, Ithaca, NY, 1975.
16. M. Sipser, Borel sets and circuit complexity; Proceedings of the 15th Symposium on the Theory of Computing (1983), pp. 61-69.
17. C. Wrathall, Complete sets and the polynomial-time hierarchy; Theoretical Computer Science 3 (1977), 23-33.