Stack Exchange
open access
CC BY-SA
Are there subexponential-time algorithms for NP-complete problems?
Are there NP-complete problems which have proven subexponential-time algorithms? I am asking for the general case inputs, I am not talking about tractable special cases here. By sub-exponential, I mean an order of growth above polynomials, but less than exponential, for example $n^{\log n}$.
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
- Complexity of hierarchically and 1-dimensional periodically specified problems#483988
- Major unsolved problems in theoretical computer science?#787499
- Reframing P Vs. NP via Structural Descent: SBI, Alankar Chains and the Emergence of Temporal Complexity Theory#74086
- Scheduling with Mandatory Breaks: NP-Hardness and an Additive-One Approximation#1119327
- Can one amplify P=NP beyond P=PH?#787563
Record · ID 796574
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