Parameterized Complexity in the Polynomial Hierarchy: Extending Parameterized Co
103,89 €
Fpt-Reducibility to SAT. - The Need for a New Completeness Theory. - A New Completeness Theory. - Fpt-algorithms with Access to a SAT Oracle. - Problems in Knowledge Representation and Reasoning.
Jetzt bei Ebay: