preprint
Open access
A continuous probability space implies P!=NP
Research footprint
At a glance
- Citations
- 0
- References
- 0
- Comments
- 0
Paper overview
Abstract
A proof that a computational problem exists (defined by a continuous sample space) whose solution can be verified in time polynomial in the number of bits of the input but which cannot be solved in time polynomial in the number of bits of the input.
Record transparency
Publication details
- DOI
- 10.5281/zenodo.7840808
- OpenAlex
- W4366232158
- Document type
- preprint
- Language
- EN
- Source
- Zenodo (CERN European Organization for Nuclear Research)
- Last metadata update
Comments
Log in to join the discussion.