Cognition and Intractability: A Guide to Classical and Parameterized Complexity Analysis, Iris van Rooij, Mark Blokpoel, Johan Kwisthout, Todd Wareham

Автор: Rodney G. Downey; M.R. Fellows
Название: Parameterized Complexity
ISBN: 1461267986 ISBN-13(EAN): 9781461267980
Издательство: Springer
Рейтинг:
Цена: 232910.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: An approach to complexity theory which offers a means of analysing algorithms in terms of their tractability. The authors consider the problem in terms of parameterized languages and taking "k-slices" of the language, thus introducing readers to new classes of algorithms which may be analysed more precisely than was the case until now.

Автор: Adler Stephen L
Название: Guide To Pamir, The: Theory And Use Of Parameterized Adaptive Multidimensional Integration Routines
ISBN: 9814425036 ISBN-13(EAN): 9789814425032
Издательство: World Scientific Publishing
Рейтинг:
Цена: 50690.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Suitable for physicists, applied mathematicians, computer scientists, and engineers, this book presents introductory materials, similar to that on the PAMIR website. It also offers details on the use of the programs than is on the website.

Автор: Iris van Rooij, Mark Blokpoel, Johan Kwisthout, Todd Wareham
Название: Cognition and Intractability: A Guide to Classical and Parameterized Complexity Analysis
ISBN: 1107043999 ISBN-13(EAN): 9781107043992
Издательство: Cambridge Academ
Рейтинг:
Цена: 120390.00 T
Наличие на складе: Невозможна поставка.
Описание: This is the first book to provide an accessible introduction to computational complexity analysis and its application to questions of intractability in cognitive science. It is essential reading for students and researchers who want to understand how cognitive models can be scaled from the lab to situations of real-world complexity.

Автор: Marek Cygan; Fedor V. Fomin; ?ukasz Kowalik; Danie
Название: Parameterized Algorithms
ISBN: 3319357026 ISBN-13(EAN): 9783319357027
Издательство: Springer
Рейтинг:
Цена: 60550.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Part III presents complexity results and lower bounds, giving negative evidence by way of W[1]-hardness, the Exponential Time Hypothesis, and kernelization lower bounds.All the results and concepts are introduced at a level accessible to graduate students and advanced undergraduate students.

Автор: Marek Cygan; Fedor V. Fomin; ?ukasz Kowalik; Danie
Название: Parameterized Algorithms
ISBN: 3319212745 ISBN-13(EAN): 9783319212746
Издательство: Springer
Рейтинг:
Цена: 60550.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Part III presents complexity results and lower bounds, giving negative evidence by way of W[1]-hardness, the Exponential Time Hypothesis, and kernelization lower bounds.All the results and concepts are introduced at a level accessible to graduate students and advanced undergraduate students.

Автор: Jianer Chen; Fedor V. Fomin
Название: Parameterized and Exact Computation
ISBN: 3642112684 ISBN-13(EAN): 9783642112683
Издательство: Springer
Рейтинг:
Цена: 69870.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 4th International Workshop IWPEC 2009 Copenhagen Denmark September 1011 2009 Revised Selected Paper. .

Автор: Rodney G. Downey; M.R. Fellows
Название: Parameterized Complexity
ISBN: 038794883X ISBN-13(EAN): 9780387948836
Издательство: Springer
Рейтинг:
Цена: 181670.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: An approach to complexity theory which offers a means of analysing algorithms in terms of their tractability. The authors consider the problem in terms of parameterized languages and taking "k-slices" of the language, thus introducing readers to new classes of algorithms which may be analysed more precisely than was the case until now.

Автор: L. Adler Stephen
Название: The Guide to Pamir: Theory and Use of Parameterized Adaptive Multidimensional Integration Routines
ISBN: 9814425044 ISBN-13(EAN): 9789814425049
Издательство: World Scientific Publishing
Рейтинг:
Цена: 24290.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Suitable for physicists, applied mathematicians, computer scientists, and engineers, this book presents introductory materials, similar to that on the PAMIR website. It also offers details on the use of the programs than is on the website.

Автор: Gregory Gutin; Stefan Szeider
Название: Parameterized and Exact Computation
ISBN: 3319038974 ISBN-13(EAN): 9783319038971
Издательство: Springer
Рейтинг:
Цена: 46570.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:

Exact Complexity and Satisfiability.- The Parameterized Complexity of Fixpoint Free Elements and Bases in Permutation Groups.- Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints.- Declarative Dynamic Programming as an Alternative Realization of Courcelle's Theorem.- The Fine Details of Fast Dynamic Programming over Tree Decompositions.- On Subexponential and FPT-Time Inapproximability.- Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization.- Chain Minors Are FPT.- Incompressibility of H-Free Edge Modification.- Contracting Few Edges to Remove Forbidden Induced Subgraphs.- Fixed-Parameter and Approximation Algorithms: A New Look.- Subgraphs Satisfying MSO Properties on z-Topologically Orderable Digraphs.- Computing Tree-Depth Faster Than 2n.- Faster Exact Algorithms for Some Terminal Set Problems.- Parameterized Algorithms for Modular-Width.- A Faster FPT Algorithm for Bipartite Contraction.- On the Ordered List Subgraph Embedding Problems.- A Completeness Theory for Polynomial (Turing) Kernelization.- On Sparsification for Computing Treewidth.- The Jump Number Problem: Exact and Parameterized.- On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges.- Hardness of r-dominating set on Graphs of Diameter (r + 1).- Amalgam Width of Matroids.- On the Parameterized Complexity of Reconfiguration Problems.- FPT Algorithms for Consecutive Ones Submatrix Problems.- Upper Bounds on Boolean-Width with Applications to Exact Algorithms.- Speeding Up Dynamic Programming with Representative Sets: An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions.- Completeness Results for Parameterized Space Classes.- Treewidth and Pure Nash Equilibria.- Algorithms for k-Internal Out-Branching.