Provable Intractability: The Class X P
We have seen many classes that are apparently different from FPT, but as with classical complexity theory, we have no proof of this fact. Moving further along, we might seek classes that are provably distinct from FPT, along the lines that EXP ≠ P. We will briefly look at one such class in this section.
KeywordsTuring Machine Initial Configuration Winning Strategy Game Problem Problem Input
Unable to display preview. Download preview PDF.