Is Integer Factorization NP-Complete?
14
1ká¹€12542100
10%
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
Esta pergunta é gerenciada e resolvida pela Predita.
Get 
1,000 to start trading!
1,000Pessoas também estão operando
Is Integer Factorization NP-Complete?
10% 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
What fraction of these numbers are hard to factor?
Ordenar por:
@FedorBeets You're correct. What does the community typically do in these cases? It doesn't seem fair to those who wagered to mark it NA, but you're also correct that there's an equivalent market.
@RealityQuotient From what I've seen, sometimes there's just multiple markets and that's fine. If they're different odds then that's weird and people can do arbitrage.
Pessoas também estão operando
Perguntas relacionadas
Is Integer Factorization NP-Complete?
10% 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
What fraction of these numbers are hard to factor?