Polynomial time computation in the context of recursive analysis

DOI10.1007/978-3-642-15331-0_10MaRDI QIDQ5747636zbMATH OpenOpenAlexFDO

Authors Walid Gomaa

Publication date 14 September 2010

Published in Foundational and Practical Aspects of Resource Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15331-0_10

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Computation over the reals, computable analysis (03D78)

Recommendations

• Characterizing polynomial time computability of rational and real functions
• scientific article; zbMATH DE number 4023258
• The basic feasible functionals in computable analysis
• scientific article; zbMATH DE number 52121
• scientific article; zbMATH DE number 1303206

Cited in

(10)

• Computing power series in polynomial time
• Polynomial-time versus recursive models
• A survey of recursive analysis and Moore's notion of real computation
• Polynomial time over the reals with parsimony
• scientific article; zbMATH DE number 4134023 (Why is no real title available?)
• Relativization of Real Numbers to a Universe
• scientific article; zbMATH DE number 1354146 (Why is no real title available?)
• The methods of approximation and lifting in real computation
• Characterizing polynomial time computability of rational and real functions
• Time-Complexity Semantics for Feasible Affine Recursions

This page was built for publication: Polynomial time computation in the context of recursive analysis

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