Succinct Representation, Leaf Languages, and Projection Reductions
- 1 May 1998
- journal article
- Published by Elsevier in Information and Computation
- Vol. 142 (2) , 207-236
- https://doi.org/10.1006/inco.1997.2696
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Succinct circuit representations and leaf language classes are basically the same conceptInformation Processing Letters, 1996
- On balanced versus unbalanced computation treesTheory of Computing Systems, 1996
- Complexity Classes and Sparse OraclesJournal of Computer and System Sciences, 1995
- A uniform approach to define complexity classesTheoretical Computer Science, 1992
- PSPACE SURVIVES CONSTANT-WIDTH BOTTLENECKSInternational Journal of Foundations of Computer Science, 1991
- On uniformity within NC1Journal of Computer and System Sciences, 1990
- Bounded-width polynomial-size branching programs recognize exactly those languages in NC1Journal of Computer and System Sciences, 1989
- Languages that Capture Complexity ClassesSIAM Journal on Computing, 1987
- Succinct representations of graphsInformation and Control, 1983
- The dot-depth hierarchy of star-free languages is infiniteJournal of Computer and System Sciences, 1978