Titlebook: Parameterized Complexity Theory; J?rg Flum,Martin Grohe Textbook 2006 Springer-Verlag Berlin Heidelberg 2006 Algorithms.Automat.algorithm.

失望昨天

inflame

放肆的你

The A-Hierarchy,archy, the A-hierarchy can be viewed as a parameterized analogue of the polynomial hierarchy. In fact, in Sect. 8.1 we shall see that, as the polynomial hierarchy, the A-hierarchy can be characterized by alternating machines. Section 8.2 is technical; in it we prove certain normal form results. In S

歡笑

Kernelization and Linear Programming Techniques,and only if it has a kernelization, that is, a polynomial time many-one reduction that maps a given instance to an instance of size effectively bounded in terms of the parameter. Kernelization may be viewed as preprocessing with an explicit performance guarantee. In this chapter, we will see that ke

有機體

The Automata-Theoretic Approach,base systems. Often, such algorithms are fixed-parameter tractable rather than polynomial time. Automata-theoretic algorithms typically apply to logicbased problems such as model-checking problems or database query evaluation. In the following chapters, however, we will see that these techniques can

興奮過度