The complexity of problems concerning graphs with regularities
- 1 January 1984
- book chapter
- Published by Springer Nature
- p. 544-552
- https://doi.org/10.1007/bfb0030338
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- The complexity of manipulating hierarchically defined sets of rectanglesPublished by Springer Nature ,1981
- New problems complete for nondeterministic log spaceTheory of Computing Systems, 1976
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- Space-bounded reducibility among combinatorial problemsJournal of Computer and System Sciences, 1975
- On tape-bounded complexity classes and multihead finite automataJournal of Computer and System Sciences, 1975
- Word problems requiring exponential time(Preliminary Report)Published by Association for Computing Machinery (ACM) ,1973
- The equivalence problem for regular expressions with squaring requires exponential spacePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1972