Nearly linear time
- 1 January 1989
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 108-118
- https://doi.org/10.1007/3-540-51237-3_10
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Short propositional formulas represent nondeterministic computationsInformation Processing Letters, 1988
- On determinism versus non-determinism and related problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- Storage Modification MachinesSIAM Journal on Computing, 1980
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979
- Relations Among Complexity MeasuresJournal of the ACM, 1979
- Satisfiability Is Quasilinear Complete in NQLJournal of the ACM, 1978