Stack Exchange
open access
CC BY-SA
Problems Between P and NPC
Factoring and graph isomorphism are problems in NP that are not known to be in P nor to be NP-Complete. What are some other (sufficiently different) natural problems that share this property? Artificial examples coming directly from the proof of Ladner's theorem do not count. Are any of these example provably NP-intermediate, assuming only some "reasonable" hypothesis?
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Major unsolved problems in theoretical computer science?#787499
- Can one amplify P=NP beyond P=PH?#787563
- Expander Hierarchies for Normalized Cuts on Graphs#163040
- CMSO-transductions for tree-like graph decompositions#1156169
- Polynomial-time isomorphism test for solvable groups with abelian Sylow subgroups#985104
Record · ID 787503
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive