MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Motivated by these posts, An NP-complete variant of factoring and Relationship between symmetry and computational intractability, It seems to be worthwhile to investigate the different factors that increase the hardness of problems in NPI. I'm interested in other NP-complete variants of problems of intermediate complexity.

Is there a recent survey paper of $NP$-complete variants of problems of intermediate complexity (problems between P and NP-complete)?

Cross posted on TCS StackExchange

UPDATE: Bounty may be awarded to an answer that gives other interesting NPI problems that have an $NP$-complete variant.

share|cite|improve this question

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.