Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs
Community Proposals
Community Proposals
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read See all your notifications »
Users Search
Help Dashboard Sign In Sign Up
Q&A Meta
Q&A
Posts Tags Edits
Ask Question

Post History

66%
+2 −0
Q&A Consequences of NP-Complete in QP?

posted 6mo ago by Peter Taylor‭

Answer
#1: Initial revision by user avatar Peter Taylor‭ · 2026-03-31T07:25:18Z (6 months ago) 
> With NPI being NP-Intermediate, problems which require quasi-polynomial complexity to solve.

No, NPI is problems in NP which are not in P and are not in NPC. The only claims about complexity which follow easily from the definition are that they take superpolynomial but no worse than exponential time (and, indeed, can be solved in exponential time with polynomial space).