A continuous probability space implies P!=NP
Authors/Creators
Description
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.
Files
Restricted
The record is publicly accessible, but files are restricted to users with access.
Request access
If you would like to request access to these files, please fill out the form below.
You need to satisfy these conditions in order for this request to be accepted:
Whoever is interested in reviewing the work and produce a referee report.
You are currently not logged in. Do you have an account? Log in here