scientific article; zbMATH DE number 1257074

MaRDI QIDQ4228729zbMATH OpenFDO

Authors Felipe Cucker, J. L. Montaña, Luis Miguel Pardo

Publication date 1 March 1999

zbMATH Keywords

algorithmscomplexitycomplexity classesparallel computationreal numbers

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Distributed algorithms (68W15) Symbolic computation and algebraic computation (68W30)

Recommendations

• \(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\)
• Computing over the reals with addition and order: Higher complexity classes
• Parallel models of computation: An introductory survey
• scientific article; zbMATH DE number 176763

Cited in

(8)

• \(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\)
• Two \(P\)-complete problems in the theory of the reals
• Concurrent cooperating solvers over reals
• Smale's 17th problem: average polynomial time to compute affine and projective solutions
• scientific article; zbMATH DE number 18636 (Why is no real title available?)
• On the non-sequential nature of the interval-domain model of real-number computation
• On the non-sequential nature of domain models of real-number computation
• The Turing degrees for some computation model with the real parameter

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4228729)