Is Integer Factorization NP-Complete?
12
1kṀ7683000
8%
chance
1H
6H
1D
1W
1M
ALL
This market will resolve once a widely-accepted proof exists that the integer factorization problem is NP-complete or is not NP-complete assuming P != NP.
This question is managed and resolved by Manifold.
Get 
1,000 to start trading!
1,000People are also trading
Related questions
Is Integer Factorization NP-Complete?
12% chance
Is Integer Factorization in P?
13% chance
Can integer factorization be solved in polynomial time on a classical computer?
10% chance
Will a polynomial time factoring algorithm be found by 2035?
9% chance
In what year will the 1801st Fibonacci number be fully factorized?
Can NP-complete problems be solved in polynomial time?
5% chance