Anzeige
Erschienen in:
1999 | OriginalPaper | Buchkapitel
Beyond W[t]-Hardness
verfasst von : R. G. Downey, M. R. Fellows
Erschienen in: Parameterized Complexity
Verlag: Springer New York
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The W[t]-classes reflect the intrinsic difficulty of solution checking formulas of bounded logical depth. Naturally, the question arises as to what happens if we have no bound on the depth and simply look at parameterized problems of “polynomial size.” When we do this, we arrive at classes hard for U t W[t]. The study of such classes is the theme of the present chapter. Two important classes immediately suggest themselves. These are the classes W[SAT] and W[P] generated by the following problems.