Computational complexity. A conversation with Bill Gasarch

MaRDI QIDQ6190881zbMATHFDO

Authors Luca Trevisan

Publication date 6 February 2024

Full work available at URL http://bulletin.eatcs.org/index.php/beatcs/article/view/785/839

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) History of computer science (68-03)

Recommendations

• Computational complexity
• \({\mathcal P}\), \({\mathcal{NP}}\) and mathematics -- a computational complexity perspective
• People, problems, and proofs. Essays from Gödel's lost letter: 2010
• Computational complexity on the blackboard
• The human face of computing

This page was built for publication: Computational complexity. A conversation with Bill Gasarch

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