Is Integer Factorization NP-Complete?
13
1kṀ10362100
12%
chance
1H
6H
1D
1W
1M
ALL
https://en.wikipedia.org/wiki/Integer_factorization
Note: this is not a question of whether Integer Factorization can be done in Polynomial time, that's independant.
Close date updated to 2099-12-31 11:59 pm
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?
8% 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