Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 1500663

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

zbMATH Open0956.68062MaRDI QIDQ4501685FDOQ4501685


Authors: Christian Schindelhauer, Andreas Jakoby Edit this on Wikidata


Publication date: 7 November 2000



Title of this publication is not available (Why is that?)



Recommendations

  • Learning classes of approximations to non-recursive functions.
  • A new algorithm design technique for hard problems, building on methods of complexity theory
  • Kolmogorov Complexity with Error
  • scientific article; zbMATH DE number 3877163
  • Category and Measure in Complexity Classes


zbMATH Keywords

complexity classes


Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)



Cited In (3)

  • Title not available (Why is that?)
  • A new algorithm design technique for hard problems, building on methods of complexity theory
  • What Percentage of Programs Halt?





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 Q4501685)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4501685&oldid=18591821"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 February 2024, at 07:49. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki