The golden ticket. P, NP, and the search for the impossible
From MaRDI portal
(Redirected from The golden ticket. P, NP, and the search for the impossible)
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) History of computer science (68-03) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40)
Recommendations
- The nature of computation
- The \(\text{P}=\text{NP}\) question and Gödel's lost letter
- In pursuit of the traveling salesman. Mathematics at the limits of computation
- Limits of computation. An introduction to the undecidable and the intractable
- \({\mathcal P}\), \({\mathcal{NP}}\) and mathematics -- a computational complexity perspective
Cited in
(7)- Quantum walk public-key cryptographic system
- \(\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
- Tensors in computations
- In pursuit of the traveling salesman. Mathematics at the limits of computation
- Polynomial algorithm for the disjoint bilinear programming problem with an acute-angled polytope for a disjoint subset
This page was built for publication: The golden ticket. P, NP, and the search for the impossible
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4912935)
