\(\mathcal P = \mathcal{NP}\)?

DOI10.1007/PL00000570zbMath1022.68064MaRDI QIDQ1404168

Martin Grötschel

Publication date: 20 August 2003

Published in: Elemente der Mathematik (Search for Journal in Brave)

zbMATH Keywords

complexity

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \(\mathcal P = \mathcal{NP}\)?