What is the complexity theoretic status of P vs NP, ETH, and Graph Isomorphism?
2.7 pt (24h)One-OffScienza
Manifold MarketsSenza KYCDati di risoluzione verificatiBen calibratoPrevisione della comunità attuale
P != NP, ETH false, GI in P 44.9%+2.7ptIn testa tra 6 esiti
P != NP, ETH false, GI in P 44.9%+2.7ptPrevisori
13
Tipo di domanda
multiple choice
Metodologia
Play-money forecasting platform
Tipo di fonte
Previsione
Variazione 7g
+36.5 pts
Dati di mercato
Aggiornato 6 ore fa
Obsoleto8 dic 23, 21:26 UTC16 dic 00, 05:59 UTC
Trend
Mercati Correlati
Domande correlate per il contesto, non un confronto tra contratti equivalenti.
Is Graph Isomorphism NP-intermediate?
Manifold MarketsIs Graph Isomorphism NP-Complete?
Manifold MarketsIs Graph Isomorphism in P?
Manifold MarketsWill the U.S. confirm that aliens exist?
KalshiWill the US confirm that aliens exist by which date?
PolymarketWill ANOTHER millennium prize problem be solved in 2026?
Manifold MarketsRegole
The Graph Isomorphism problem (GI) was shown by Babai to be subexponential.
- Therefore, the possibility that GI is NP-complete is inconsistent with the exponential time hypothesis
- The answers provide the remaining mutually exclusive possibilities for the questions of whether:
- GI is NP-Complete