Is Graph Isomorphism NP-Complete? | Manifold

Is Graph Isomorphism NP-Complete?

23

1kṀ1254

3000

7%

chance

1H

6H

1D

1W

1M

ALL

This market will resolve once a widely-accepted proof exists that the graph isomorphism problem is NP-complete or is not NP-complete assuming P != NP.

Computational Complexity Theory

Get

1,000

to start trading!

People are also trading

Is Graph Isomorphism NP-intermediate?

Is Graph Isomorphism in P?

What is the complexity theoretic status of P vs NP, ETH, and Graph Isomorphism?

Can quantum computer check isomorphism of graphs in the described way?

Related questions

Is Graph Isomorphism NP-intermediate?

Is Graph Isomorphism in P?

What is the complexity theoretic status of P vs NP, ETH, and Graph Isomorphism?

Can quantum computer check isomorphism of graphs in the described way?

© Manifold Markets, Inc.•Terms•Privacy