Live briefing
Everything about NP-intermediate
Complexity class of problems
In computational complexity, problems that are in the complexity class NP but are neither in the class P nor NP-complete are called NP-intermediate, and the class of such problems is called NPI. Ladner's theorem, shown in 1975 by Richard E. Ladner, is a result asserting that, if P ≠ NP, then NPI is not empty; that is, NP contains problems that are neither in P nor NP-complete. Since it is also true that if NPI problems exist, then P ≠ NP, it follows that P = NP if and only if NPI is empty. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: NP-intermediateA 5-minute orientation
- Skim a recent paper: Noisy intermediate-scale quantum algorithmsInfluential work since 2022
- Pick up a classic book: Lower Intermediate Social Studies Set - 7 ThemesThe most-reprinted book on the subject
- Read the landmark paper: Transcatheter or Surgical Aortic-Valve Replacement in Intermediate-Risk PatientsCited 4,535 times
- Go sideways: Graph isomorphism problemA closely related topic
- Go sideways: NP-completenessA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Transcatheter or Surgical Aortic-Valve Replacement in Intermediate-Risk Patients
Surgical or Transcatheter Aortic-Valve Replacement in Intermediate-Risk Patients
CNS stem cells express a new class of intermediate filament protein
Increasing the Efficiency of Ideal Solar Cells by Photon Induced Transitions at Intermediate Levels
Evolutionary tracks and isochrones for low- and intermediate-mass stars: From 0.15 to 7 $M_{\odot}$, and from $Z=0.0004$ to 0.03
The Optimal Degree of Commitment to an Intermediate Monetary Target
An intermediate neglect of differential overlap technique for spectroscopy: Pyrrole and the azines
The Genesis of Intermediate and Silicic Magmas in Deep Crustal Hot Zones
🆕 Influential since 2022
Noisy intermediate-scale quantum algorithms
Unraveling the electronegativity-dominated intermediate adsorption on high-entropy alloy electrocatalysts
19.31% binary organic solar cell and low non-radiative recombination enabled by non-monotonic intermediate state transition
Electrocatalytic CO 2 -to-C 2+ with Ampere-Level Current on Heteroatom-Engineered Copper via Tuning *CO Intermediate Coverage
Electrode reconstruction strategy for oxygen evolution reaction: maintaining Fe-CoOOH phase with intermediate-spin state during electrolysis
📚 Books worth reading
- 📕Lower Intermediate Social Studies Set - 7 ThemesBenchmark Education Company LLC Staff · 2006
- 📕The Ultimate Guitar Pentatonic Scales Book
- 📕Studies in organometallic photochemistryDavid Earl Marx · 1987
Few-Body Problems in Physics '99Shinsho Oryu · 2000
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Graph isomorphism problem Unsolved problem in computer science Can the graph isomorphism problem be solved in polynomial time? More unsolved problems in computer science The graph…
- NP-completeness In computational complexity theory, NP-complete problems are the hardest of the problems to which solutions can be verified quickly. NP is short for "nondetermi…
- Clique problem In computer science, the clique problem is the computational problem of finding cliques (subsets of vertices, all adjacent to each other, also called complete…
- List of NP-complete problems This is a list of some of the more commonly known problems that are NP-complete when expressed as decision problems. As there are thousands of such problems…
- Graph canonization In graph theory, a branch of mathematics, graph canonization is the problem of finding a canonical form of a given graph G. A canonical form is a labeled…
- Quasi-polynomial time In computational complexity theory and the analysis of algorithms, an algorithm is said to take quasi-polynomial time if its time complexity is quasi-polynomial…
- Exponential time hypothesis In computational complexity theory, the exponential time hypothesis (ETH) states that satisfiability of 3-CNF Boolean formulas (3-SAT) cannot be solved…
- Graph isomorphism In graph theory, an isomorphism of graphs G and H is a bijection between the vertex sets of G and H f:V(G)→V(H) such that any two vertices u and v of G…