The Meaning of the Conjecture P � NP for Mathematical Logic
From MaRDI portal
Publication:3657987
DOI10.2307/2975817zbMATH Open0513.03028OpenAlexW2331506176WikidataQ123093690 ScholiaQ123093690MaRDI QIDQ3657987
Publication date: 1983
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2975817
Complexity of computation (including implicit computational complexity) (03D15) Complexity of proofs (03F20)
This page was built for publication: The Meaning of the Conjecture P � NP for Mathematical Logic