|
|
Sold Out
Book Categories |
| 1 | Fixed-parameter tractability | 1 |
| 2 | Reductions and parameterized intractability | 33 |
| 3 | The class W[P] | 45 |
| 4 | Logic and complexity | 65 |
| 5 | Two fundamental hierarchies | 95 |
| 6 | The first level of the hierarchies | 105 |
| 7 | The W-hierarchy | 133 |
| 8 | The A-hierarchy | 165 |
| 9 | Kernelization and linear programming techniques | 207 |
| 10 | The automata-theoretic approach | 233 |
| 11 | Tree width | 261 |
| 12 | Planarity and bounded local tree width | 301 |
| 13 | Homomorphisms and embeddings | 327 |
| 14 | Parameterized counting problems | 357 |
| 15 | Bounded fixed-parameter tractability | 389 |
| 16 | Subexponential fixed-parameter tractability | 417 |
| App | Background from complexity theory | 453 |
| Price | Condition | Delivery | Seller | Action |
| $99.99 | Digital |
| WonderClub |
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish List
X
This item is in your Collection
Parameterized Complexity Theory
X
This Item is in Your Inventory
Parameterized Complexity Theory
X
You must be logged in to review the productsX
X
X
Add Parameterized Complexity Theory, 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 developmen, Parameterized Complexity Theory to the inventory that you are selling on WonderClubX
X
Add Parameterized Complexity Theory, 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 developmen, Parameterized Complexity Theory to your collection on WonderClub |