Topics in real and complex number complexity theory
From MaRDI portal
Complexity of computation (including implicit computational complexity) (03D15) Undecidability and degrees of sets of sentences (03D35) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Recommendations
- scientific article; zbMATH DE number 1069617
- scientific article; zbMATH DE number 66618
- Complexity of computation on real algebraic numbers
- scientific article; zbMATH DE number 52121
- Real Algebraic Numbers: Complexity Analysis and Experimentation
- Complexity questions in number theory
- scientific article; zbMATH DE number 953024
- scientific article; zbMATH DE number 1263207
- scientific article; zbMATH DE number 4077311
- Real numbers, continued fractions and complexity classes
Cited in
(21)- Real number models under various sets of operations
- Real data-integer solution problems within the Blum-Shub-Smale computational model
- On weak-space complexity over complex numbers
- Some aspects of studying an optimization or decision problem in different computational models
- Computing over the reals with addition and order: Higher complexity classes
- The PCP theorem for NP over the reals
- An algebraic proof of the real number PCP theorem
- An Algebraic Proof of the Real Number PCP Theorem
- Some results on interactive proofs for real computations
- Decision Versus Evaluation in Algebraic Complexity
- On the Complexity of Numerical Analysis
- scientific article; zbMATH DE number 4023258 (Why is no real title available?)
- scientific article; zbMATH DE number 4077311 (Why is no real title available?)
- scientific article; zbMATH DE number 52121 (Why is no real title available?)
- scientific article; zbMATH DE number 66618 (Why is no real title available?)
- scientific article; zbMATH DE number 176033 (Why is no real title available?)
- On the Structure of $\cal NP_\Bbb C$
- scientific article; zbMATH DE number 1263207 (Why is no real title available?)
- Satisfiability of cross product terms is complete for real nondeterministic polytime Blum-Shub-Smale machines
- A theory of complexity, condition, and roundoff
- A note on a theorem of Blum, Shub, and Smale
This page was built for publication: Topics in real and complex number complexity theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501602)