Characterizing polynomial time computability of rational and real functions

MaRDI QIDQ5146653zbMATH OpenFDO

Authors Walid Gomaa

Publication date 26 January 2021

Full work available at URL http://eptcs.web.cse.unsw.edu.au/paper.cgi?DCM2009.7

Mathematics Subject Classification ID

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

Recommendations

• Polynomial time computation in the context of recursive analysis
• scientific article; zbMATH DE number 52121
• scientific article; zbMATH DE number 1746037
• The basic feasible functionals in computable analysis
• On the time complexity of partial real functions

Cited in

(10)

• Computing power series in polynomial time
• A term rewriting characterization of the functions computable in polynomial space
• On the time complexity of partial real functions
• Polynomial time over the reals with parsimony
• Differentiability of polynomial time computable functions
• scientific article; zbMATH DE number 4134023 (Why is no real title available?)
• scientific article; zbMATH DE number 4023258 (Why is no real title available?)
• scientific article; zbMATH DE number 6862041 (Why is no real title available?)
• A Note on The Functions Which Are Not Polynomial Time Computable From Their Graphs
• Polynomial time computation in the context of recursive analysis

This page was built for publication: Characterizing polynomial time computability of rational and real functions

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