The millennium problem about computational intractability

DOI10.1007/S44425-025-00003-WMaRDI QIDQ7316583zbMATH OpenFDO

Authors Celina M. H. de Figueiredo

Publication date 19 August 2026

Published in Matemática Contemporânea (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S44425-025-00003-W

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Cites work

• A brief history of NP-completeness, 1954--2012
• A structured program to generate all topological sorting arrangements
• Abel Interview 2021: L 'aszl 'o Lov 'asz and Avi Wigderson
• Hardness vs randomness
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• scientific article; zbMATH DE number 1875851 (Why is no real title available?)
• Introduction to algorithms.
• Mathematics and computation. A theory revolutionizing technology and science
• Reducibility among combinatorial problems
• The complexity of theorem-proving procedures
• Universality and tolerance

This page was built for publication: The millennium problem about computational intractability

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