Using inductive counting to simulate nondeterministic computation
- 1 December 2005
- book chapter
- Published by Springer Nature
- p. 187-194
- https://doi.org/10.1007/bfb0029607
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Some notes on strong and weak log log n space complexityInformation Processing Letters, 1989
- The method of forced enumeration for nondeterministic automataActa Informatica, 1988
- Nondeterministic Space is Closed under ComplementationSIAM Journal on Computing, 1988
- On the construction of parallel computers from various bases of boolean functionsTheoretical Computer Science, 1986
- A taxonomy of problems with fast parallel algorithmsInformation and Control, 1985
- On the unique satisfiability problemInformation and Control, 1982
- On uniform circuit complexityJournal of Computer and System Sciences, 1981
- On the Tape Complexity of Deterministic Context-Free LanguagesJournal of the ACM, 1978
- Parallelism in random access machinesPublished by Association for Computing Machinery (ACM) ,1978
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970