On digital nondeterminism
From MaRDI portal
Recommendations
Cites work
- \(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\)
- ``Neural computation of decisions in optimization problems
- A note on a P NP result for a restricted class of real machines
- Accessible telephone directories
- Analog computation via neural networks
- Bounds for the computational power and learning complexity of analog neural nets
- Complete problems for deterministic polynomial time
- Disordered Systems and Biological Organization
- scientific article; zbMATH DE number 4114603 (Why is no real title available?)
- Neural networks and physical systems with emergent collective computational abilities
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- On the complexity of computations under varying sets of primitives
- On the Complexity of Quantifier Elimination: the Structural Approach
- Two \(P\)-complete problems in the theory of the reals
Cited in
(17)- Exotic quantifiers, complexity classes, and complete problems
- Dynamical recognizers: real-time language recognition by analog computers
- Separation of complexity classes in Koiran's weak model
- Computing over the reals with addition and order
- On the complexity of quadratic programming in real number models of computation
- On NP-completeness for linear machines
- Some aspects of studying an optimization or decision problem in different computational models
- On the P-NP problem over real matrix rings
- Computational complexity of multi-player evolutionarily stable strategies
- The PCP theorem for NP over the reals
- A note on parallel and alternating time
- On the height used by additives BSS machines
- Logics which capture complexity classes over the reals
- On NC-real complexity classes for additive circuits and their relations with NC
- On Non-Detectability of Non-Computability and the Degree of Non-Computability of Solutions of Circuit and Wave Equations on Digital Computers
- The P-DNP problem for infinite Abelian groups
- Generalization of the subset sum problem and cubic forms
This page was built for publication: On digital nondeterminism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4717055)
