Facts
Citation
URLhttps://en.wikipedia.org/wiki/Ladner%27s_theorem
Sources
Ladner's theorem, Wikipedia
Lead sectionQuote, Lead section
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.
Claims Backed By This Source (4 claims)
This source backs 4 claims across the atlas. As facts: 3 well-attested. Plus 1 entities citing it as a general reference with no single fact or relationship attached.
Disposition By Topic
- Theorems, 3 claims: 2 well-attested, 1 general references.
- Sources, 1 claims: 1 well-attested.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.