Succinct circuit representations and leaf language classes are basically the same concept
- 26 August 1996
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 59 (4) , 211-215
- https://doi.org/10.1016/0020-0190(96)00096-8
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- A uniform approach to define complexity classesTheoretical Computer Science, 1992
- Succinct representations of graphsInformation and Control, 1983
- The circuit value problem is log space complete for PACM SIGACT News, 1975
- Computational Work and Time on Finite MachinesJournal of the ACM, 1972