<p><span>Parameterized complexity theory is a recent branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic problems. The central notion of the theory, fixed-parameter tractability, has led to the development of various new algorithmic techniqu
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
β Scribed by J. Flum, M. Grohe
- Publisher
- Springer
- Year
- 2006
- Tongue
- English
- Leaves
- 494
- Series
- Texts in Theoretical Computer Science. An EATCS Series
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
<span>Finite model theory is an area of mathematical logic that grew out of computer science applications. The main sources of motivational examples for finite model theory are found in database theory, computational complexity, and formal languages, although in recent years connections with other a
<span>Finite model theory,as understoodhere, is an areaof mathematicallogic that has developed in close connection with applications to computer science, in particular the theory of computational complexity and database theory. One of the fundamental insights of mathematical logic is that our unders