Beyond NP

DOI10.1145/1060590.1060609MaRDI QIDQ3581420zbMATH OpenOpenAlexWikidataFDO

Authors Lance Fortnow

Publication date 16 August 2010

Published in Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1060590.1060609

Mathematics Subject Classification ID

Biographies, obituaries, personalia, bibliographies (01A70) History of computer science (68-03)

Recommendations

• NP-completeness: a retrospective
• scientific article; zbMATH DE number 2226428
• Beyond \(\mathbf{P}^{\mathbf{NP}}=\mathbf{NEXP}\)
• scientific article; zbMATH DE number 3978381
• Beyond NP: quantifying over answer sets
• A brief history of NP-completeness, 1954--2012
• scientific article; zbMATH DE number 7676615
• A recursion-theoretic approach to NP
• \({\mathcal P}\), \({\mathcal{NP}}\) and mathematics -- a computational complexity perspective
• P, NP, and the Post correspondence problem

Cited in

(3)

• Efficient Probabilistically Checkable Debates
• A brief history of NP-completeness, 1954--2012
• Computer Science Logic

This page was built for publication: Beyond NP

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