Why is the P=?NP question so difficult

zbMATH Open1261.03131MaRDI QIDQ4918399FDOQ4918399

Authors: Francisco Antonio Doria, N. C. A. da Costa 

Publication date: 24 April 2013

Recommendations

• \({\mathcal P}\), \({\mathcal{NP}}\) and mathematics -- a computational complexity perspective
• On the metamathematics of the P vs. NP question
• What one has to know when attacking \(\mathsf{P}\) vs.\(\mathsf{NP}\)
• \(\mathrm P \overset {?} {=} \mathrm{NP}\)
• To the problem P=?NP

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of computation (including implicit computational complexity) (03D15)

Cited In (2)

• On the metamathematics of the P vs. NP question
• Title not available (Why is that?)

This page was built for publication: Why is the \(\mathrm{P}=?\mathrm{NP}\) question so difficult

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