On digital nondeterminism
- 1 December 1996
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 29 (6) , 635-647
- https://doi.org/10.1007/bf01301968
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Analog computation via neural networksTheoretical Computer Science, 1994
- Accessible telephone directoriesThe Journal of Symbolic Logic, 1994
- On the Complexity of Quantifier Elimination: the Structural ApproachThe Computer Journal, 1993
- Two P-complete problems in the theory of the realsJournal of Complexity, 1992
- A note on a P ≠ NP result for a restricted class of real machinesJournal of Complexity, 1992
- PR ≠ NCRJournal of Complexity, 1992
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machinesBulletin of the American Mathematical Society, 1989
- Algebraic Complexity TheoryAnnual Review of Computer Science, 1988
- On the complexity of computations under varying sets of primitivesJournal of Computer and System Sciences, 1979
- Complete problems for deterministic polynomial timeTheoretical Computer Science, 1976