Hard Problems That Quickly Become Very Easy

12/17/2020
by   Barnaby Martin, et al.
0

A graph class is hereditary if it is closed under vertex deletion. We give examples of NP-hard, PSPACE-complete and NEXPTIME-complete problems that become constant-time solvable for every hereditary graph class that is not equal to the class of all graphs.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset