scientific article; zbMATH DE number 7676615

MaRDI QIDQ5889378zbMATH OpenFDO

Authors

Publication date 20 April 2023

Full work available at URL http://bharataganitaparisad.com/wp-content/uploads/2016/12/ch8.pdf

zbMATH Keywords

complexity theoryP versus NP

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• scientific article; zbMATH DE number 5787962
• scientific article; zbMATH DE number 3978381
• P, NP, and the Post correspondence problem
• P versus NP: the star problem of the mathematics of computation
• scientific article; zbMATH DE number 62443
• On the P vs NP question: a proof of inequality
• scientific article; zbMATH DE number 7683979
• Beyond \(\mathbf{P}^{\mathbf{NP}}=\mathbf{NEXP}\)
• scientific article; zbMATH DE number 2226428

Cited in

(3)

• What one has to know when attacking \(\mathsf {P}\) vs. \(\mathsf {NP}\) (extended abstract)
• Beyond NP
• scientific article; zbMATH DE number 5787962 (Why is no real title available?)

This page was built for publication:

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