Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Polynomial Time Computation in the Context of Recursive Analysis

From MaRDI portal
Publication:5747636
Jump to:navigation, search

DOI10.1007/978-3-642-15331-0_10zbMath1306.03020OpenAlexW2111279950MaRDI QIDQ5747636

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)


Related Items (1)

A survey of recursive analysis and Moore's notion of real computation







This page was built for publication: Polynomial Time Computation in the Context of Recursive Analysis

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5747636&oldid=30507841"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 7 March 2024, at 04:59.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki