Revisions - MathOverflow

Return to Question

tag is added

edited Jun 27 2011 at 10:59

Mohammad Al-Turkistany
267●1●8

added 124 characters in body

view source

edited Jun 27 2011 at 10:44

Mohammad Al-Turkistany
267●1●8

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.

added 5 characters in body

view source

edited Jun 23 2011 at 15:52

Mohammad Al-Turkistany
267●1●8

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