Is Integer Factorization NP-Complete? | Manifold

Is Integer Factorization NP-Complete?

13

1kṀ1036

2100

12%

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

Computational Complexity Theory

Get

1,000

to start trading!

Sort by:

Seems like a duplicate of https://manifold.markets/BoltonBailey/is-integer-factorization-npcomplete

predictedNO

@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.

predictedNO

@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.

Added M130 of additional Liquidity.

And it's resolving in 24 hours how?

@jonsimon I'm a optimist...

But point taken, extended to Dec 31, 2099

Related questions

Can NP-complete problems be solved in polynomial time?

Is Integer Factorization NP-Complete?

Can integer factorization be solved in polynomial time on a classical computer?

Is Integer Factorization in P?

In what year will the 1801st Fibonacci number be fully factorized?

Will a polynomial time factoring algorithm be found by 2035?

Related questions

Can NP-complete problems be solved in polynomial time?

Is Integer Factorization in P?

Is Integer Factorization NP-Complete?

In what year will the 1801st Fibonacci number be fully factorized?

Can integer factorization be solved in polynomial time on a classical computer?

Will a polynomial time factoring algorithm be found by 2035?

© Manifold Markets, Inc.•Terms + Mana-only Terms•Privacy•Rules