失望昨天 发表于 2025-3-26 23:03:32

http://reply.papertrans.cn/75/7412/741149/741149_31.png

inflame 发表于 2025-3-27 02:00:03

http://reply.papertrans.cn/75/7412/741149/741149_32.png

放肆的你 发表于 2025-3-27 06:06:03

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

欢笑 发表于 2025-3-27 12:58:17

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

有机体 发表于 2025-3-27 16:59:01

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

兴奋过度 发表于 2025-3-27 18:10:01

http://reply.papertrans.cn/75/7412/741149/741149_36.png
页: 1 2 3 [4]
查看完整版本: Titlebook: Parameterized Complexity Theory; Jörg Flum,Martin Grohe Textbook 2006 Springer-Verlag Berlin Heidelberg 2006 Algorithms.Automat.algorithm.