Languages represented by Boolean formulas
- 15 September 1997
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 63 (5), 251-256
- https://doi.org/10.1016/s0020-0190(97)00134-8
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Succinct circuit representations and leaf language classes are basically the same conceptInformation Processing Letters, 1996
- Methods for proving completeness via logical reductionsTheoretical Computer Science, 1993
- The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problemsJournal of Computer and System Sciences, 1992
- The computational complexity of graph problems with succinct multigraph representationMathematical Methods of Operations Research, 1988
- Languages that Capture Complexity ClassesSIAM Journal on Computing, 1987
- A note on succinct representations of graphsInformation and Control, 1986
- The complexity of combinatorial problems with succinct input representationActa Informatica, 1986
- Succinct representations of graphsInformation and Control, 1983