Login / Signup

Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy.

Víctor DalmauLászló EgriPavol HellBenoît LaroseArash Rafiey
Published in: LICS (2015)
Keyphrases
  • decision problems
  • problems involving
  • computational complexity
  • np hard
  • practical problems
  • real time
  • real world
  • decision making
  • website
  • lower bound
  • np complete
  • computational issues
  • polynomial hierarchy