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 1498462

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

zbMATH Open0948.68087MaRDI QIDQ4499533FDOQ4499533


Authors: V. M. Khrapchenko Edit this on Wikidata


Publication date: 30 August 2000



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



Recommendations

  • scientific article; zbMATH DE number 1498464
  • On algorithm complexity
  • scientific article; zbMATH DE number 139642
  • scientific article; zbMATH DE number 4087011


zbMATH Keywords

complexitylower bound


Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Philosophy of mathematics (00A30)



Cited In (1)

  • On the meaning of works by V. M. Khrapchenko





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

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