P versus NP: the star problem of the mathematics of computation
From MaRDI portal
Recommendations
Cited in
(11)- \(\mathrm P \overset {?} {=} \mathrm{NP}\)
- People, problems, and proofs. Essays from Gödel's lost letter: 2010
- Algorithmic barriers falling: P = NP? A conversation with Donald E. Knuth conducted by Edgar G. Daylight on 18 June 2014 in Paris. Edited by Kurt De Grave
- The \(\text{P}=\text{NP}\) question and Gödel's lost letter
- scientific article; zbMATH DE number 5787962 (Why is no real title available?)
- scientific article; zbMATH DE number 4098721 (Why is no real title available?)
- scientific article; zbMATH DE number 1212385 (Why is no real title available?)
- scientific article; zbMATH DE number 2012168 (Why is no real title available?)
- \({\mathcal P}\), \({\mathcal{NP}}\) and mathematics -- a computational complexity perspective
- A short essay towards if P not equal NP
- scientific article; zbMATH DE number 7676615 (Why is no real title available?)
This page was built for publication: P versus NP: the star problem of the mathematics of computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2906531)