If P=NP is proven, will the first proof be constructive?
28
1kṀ11012999
29%
chance
1H
6H
1D
1W
1M
ALL
Resolves YES if P is proven to equal NP with the construction of a polynomial-time algorithm for an NP-complete problem, NO if P=NP is proven some other way, N/A if P is proven to not equal NP or the problem is proven unsolvable somehow.
This question is managed and resolved by Manifold.
Get 
1,000 to start trading!
1,000People are also trading
Related questions
P = NP (will it be proven by April 2027)
2% chance
When will P=NP Problem be solved or proved not solvable?
Does P = NP?
7% chance
P != NP (will it be proven by April 2027)
3% chance
When will someone successfully solve P vs NP?
Is P vs NP solvable?
65% chance
Will P vs NP be proven to be solvable by the end of 2030?
14% chance
Will geometric complexity theory solve P vs NP?
10% chance
When will we have a fully formalized proof of the Poincare Conjecture?
Will P vs NP be resolved by the end of these years?