-2

We know that under hierarchy collapse results GI is not NP complete.

Would there be any consequences if GI is equivalent to a promise version of an NP complete problem?

Turbo
  • 2,947
  • 14
  • 27

1 Answers1

2

No. Simple reductions from GI to SAT are efficiently invertible, so for any such reduction, GI is equivalent to SAT-that's-promised-to-be-in-the-range-of-the-reduction.

Juho
  • 22,905
  • 7
  • 63
  • 117