Topics in real and complex number complexity theory

DOI10.1090/CONM/604/12067MaRDI QIDQ5501602zbMATH OpenOpenAlexFDO

Authors Martijn Baartse, Klaus Meer

Publication date 4 August 2015

Published in Recent Advances in Real Complexity and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/conm/604/12067

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of computation (including implicit computational complexity) (03D15) Undecidability and degrees of sets of sentences (03D35)

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

(18)

• Decision Versus Evaluation in Algebraic Complexity
• A note on a theorem of Blum, Shub, and Smale
• 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 1263207 (Why is no real title available?)
• scientific article; zbMATH DE number 176033 (Why is no real title available?)
• The PCP theorem for NP over the reals
• Real number models under various sets of operations
• An algebraic proof of the real number PCP theorem
• On the Complexity of Numerical Analysis
• A theory of complexity, condition, and roundoff
• An Algebraic Proof of the Real Number PCP Theorem
• scientific article; zbMATH DE number 4023258 (Why is no real title available?)
• Satisfiability of cross product terms is complete for real nondeterministic polytime Blum-Shub-Smale machines
• On weak-space complexity over complex numbers
• scientific article; zbMATH DE number 4077311 (Why is no real title available?)
• Some results on interactive proofs for real computations
• Some aspects of studying an optimization or decision problem in different computational models

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)