Advertisement

Provable Intractability: The Class X P

  • R. G. Downey
  • M. R. Fellows
Part of the Monographs in Computer Science book series (MCS)

Abstract

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 EXPP. We will briefly look at one such class in this section.

Keywords

Turing Machine Initial Configuration Winning Strategy Game Problem Problem Input 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1999

Authors and Affiliations

  • R. G. Downey
    • 1
  • M. R. Fellows
    • 2
  1. 1.Department of MathematicsVictoria University, WellingtonWellingtonNew Zealand
  2. 2.Department of Computer ScienceUniversity of Victoria, VictoriaVictoriaCanada

Personalised recommendations