Is Integer Factorization NP-Complete?
12
51
Ṁ986Ṁ380
2100
8%
chance
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
Get Ṁ200 play money
Related questions
Sort by:
Seems like a duplicate of https://manifold.markets/BoltonBailey/is-integer-factorization-npcomplete
@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.
Related questions
Is Graph Isomorphism NP-Complete?
7% chance
Is normal-play dots-and-boxes PSPACE-complete (YES) or in NP (NO)?
56% chance
Can NP-complete problems be solved in polynomial time?
5% chance
Is P vs NP solvable?
65% chance
Is Integer Factorization in P?
20% chance
Is Graph Isomorphism NP-intermediate?
33% chance
Does P = NP?
7% chance
Is Graph Isomorphism in P?
63% chance
Can integer factorization be solved in polynomial time on a classical computer?
10% chance
Lehmer's totient problem: Is there a composite solution to φ(n) | n-1?
27% chance