Stack Exchangeopen access
Is Norbert Blum's 2017 proof that $P \ne NP$ correct?
cc.complexity theory, np hardness, complexity classes, cstheory, cc-by-sa-3.0
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗Related documents
Record · ID 787500
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.