Succinct circuit representations and leaf language classes are basically the same concept

Information Processing Letters

Volumn 59, Issue 4, 1996, Pages 211-215

  Borchert, Bernd ^a   Lozano, Antoni ^b  

^a UNIVERSITY OF HEIDELBERG   (Germany)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Computational complexity; Leaf language classes; Polynomial time many one completeness; Succinct representations

Indexed keywords

EID: 0002016130     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00096-8     Document Type: Article

References (13)

1. J.L. Balcázar, J. Díaz and J. Gabarró, Structural Complexity I (Springer, Berlin, 1988.
2. J.L. Balcázar, A. Lozano and J. Torán. The complexity of algorithmic problems on succinct instances, in: R. BaezaYates and U. Manber, eds., Computer Science (Plenum Press, New York, 1992) 351-377.
3. B. Borchert, Predicate classes and promise classes, in: Proc. 9th Structure in Complexity Theory Conf. (1994) 235-241.
4. D.P. Bovet, P. Crescenzi and R. Silvestri, Complexity classes and sparse oracles, in: Proc. 6th Structure in Complexity Theory Conf. (1991) 102-108.
5. D.P. Bovet, P. Crescenzi and R. Silvestri, A uniform approach to define complexity classes, Theoret. Comput. Sci. 104 (1992) 263-283.
6. S.A. Cook, The complexity of theorem proving procedures, Proc. 3rd Ann. ACM Symp. on the Theory of Computing (1971) 151-158.
7. H. Galperin and A. Wigderson, Succinct representations of graphs, Inform, and Control 56 (1983) 183-198.
8. U. Hertrampf, C. Lautemann, T. Schwentick, H. Vollmer and K. Wagner, On the power of polynomial time bit-computations, in: Proc. 8th Structure in Complexity Theory Conf. (1993) 200-207.
9. B. Jenner, P. McKenzie and D. Thérien, Logspace and logtime leaf languages, in: Proc. 9th Structure in Complexity Theory Conf. (1994) 242-254.
10. R. Karp, Reducibility among combinatorial problems, in: R.E. Miller and J.W. Thatcher, eds., Complexity of Computer Computations (Plenum Press, New York, 1972) 85-103.
11. R. Ladner, The circuit value problem is log space complete for P, SIGACT News 7 (1975) 18-20.
12. J.E. Savage, Computational work and time of finite machines, J. ACM 19 (1972) 660-674.
13. H. Veith, Succinct representation, leaf languages, and projection reductions, in: Proc. 11th Ann. IEEE Conf. on Computational Complexity (1996) 118-126.