Parameterized Complexity in the Polynomial Hierarchy, Ronald de Haan
Автор: Rodney G. Downey; M.R. Fellows Название: Parameterized Complexity ISBN: 038794883X ISBN-13(EAN): 9780387948836 Издательство: Springer Рейтинг: Цена: 27251.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.
Автор: V. Bykov; A. Kytmanov; M. Lazman; Mikael Passare Название: Elimination Methods in Polynomial Computer Algebra ISBN: 9401062307 ISBN-13(EAN): 9789401062305 Издательство: Springer Рейтинг: Цена: 6986.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The subject of this book is connected with a new direction in mathematics, which has been actively developed over the last few years, namely the field of polynomial computer algebra, which lies at the intersection point of algebra, mathematical analysis and programming.
Автор: Mora Название: Solving Polynomial Equation Systems III ISBN: 0521811554 ISBN-13(EAN): 9780521811552 Издательство: Cambridge Academ Рейтинг: Цена: 18216.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This third volume of four describes all the most important techniques, mainly based on Groebner bases. It covers the `standard` solutions (Gianni-Kalkbrener, Auzinger-Stetter, Cardinal-Mourrain) as well as the more innovative (Lazard-Rouillier, Giusti-Heintz-Pardo). The author also explores the historical background, from Bezout to Macaulay.
Автор: Rodney G. Downey; M.R. Fellows Название: Parameterized Complexity ISBN: 1461267986 ISBN-13(EAN): 9781461267980 Издательство: Springer Рейтинг: Цена: 34937.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.
Автор: Marek Cygan; Pinar Heggernes Название: Parameterized and Exact Computation ISBN: 3319135236 ISBN-13(EAN): 9783319135236 Издательство: Springer Рейтинг: Цена: 7826.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the thoroughly refereed post-conference proceedings of the 9th International Symposium on Parameterized and Exact Computation, IPEC 2014, in Wroclaw, Poland, in September 2014. parameterized complexity theory, relationship between parameterized complexity and traditional complexity classifications;
Computability theory is a branch of mathematical logic and computer science that has become increasingly relevant in recent years. The field has developed growing connections in diverse areas of mathematics, with applications suitable to topology, group theory, and other subfields.
In A Hierarchy of Turing Degrees, Rod Downey and Noam Greenberg introduce a new hierarchy that allows them to classify the combinatorics of constructions from many areas of computability theory, including algorithmic randomness, Turing degrees, effectively closed sets, and effective structure theory. This unifying hierarchy gives rise to new natural definability results for Turing degree classes, demonstrating how dynamic constructions become reflected in definability. Downey and Greenberg present numerous construction techniques involving high-level nonuniform arguments, and their self-contained work is appropriate for graduate students and researchers.
Blending traditional and modern research results in computability theory, A Hierarchy of Turing Degrees establishes novel directions in the field.
Автор: Gregory Gutin; Stefan Szeider Название: Parameterized and Exact Computation ISBN: 3319038974 ISBN-13(EAN): 9783319038971 Издательство: Springer Рейтинг: Цена: 6986.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
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.
Автор: Martin Grohe; Rolf Niedermeier Название: Parameterized and Exact Computation ISBN: 354079722X ISBN-13(EAN): 9783540797227 Издательство: Springer Рейтинг: Цена: 9083.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Constitutes the refereed proceedings of the Third International Workshop on Parameterized and Exact Computation, IWPEC 2008, held in Victoria, Canada, in May 2008 - co-located with the 40th ACM Symposium on Theory of Computing, STOC 2008.
Автор: B.N. Sahney Название: Polynomial and Spline Approximation ISBN: 902770984X ISBN-13(EAN): 9789027709844 Издательство: Springer Рейтинг: Цена: 26546.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Proceedings of the NATO Advanced Study Institute, Calgary, Canada, August 26-September 2, 1978
Автор: Vladimir V. Andrievskii; Hans-Peter Blatt Название: Discrepancy of Signed Measures and Polynomial Approximation ISBN: 1441931465 ISBN-13(EAN): 9781441931467 Издательство: Springer Рейтинг: Цена: 25853.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: A concise outline of the basic facts of potential theory and quasiconformal mappings makes this book an ideal introduction for non-experts who want to get an idea of applications of potential theory and geometric function theory in various fields of construction analysis.
Автор: Peter Stefanidis; Andrzej P. Paplinski; Michael J. Название: Numerical Operations with Polynomial Matrices ISBN: 3540549927 ISBN-13(EAN): 9783540549925 Издательство: Springer Рейтинг: Цена: 15672.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The purpose of this monograph is to describe a class of com-putational methods, based on polynomial matrices, for thedesign of dynamic compensators for linear multi-variablecontrol systems.
Computability theory is a branch of mathematical logic and computer science that has become increasingly relevant in recent years. The field has developed growing connections in diverse areas of mathematics, with applications suitable to topology, group theory, and other subfields.
In A Hierarchy of Turing Degrees, Rod Downey and Noam Greenberg introduce a new hierarchy that allows them to classify the combinatorics of constructions from many areas of computability theory, including algorithmic randomness, Turing degrees, effectively closed sets, and effective structure theory. This unifying hierarchy gives rise to new natural definability results for Turing degree classes, demonstrating how dynamic constructions become reflected in definability. Downey and Greenberg present numerous construction techniques involving high-level nonuniform arguments, and their self-contained work is appropriate for graduate students and researchers.
Blending traditional and modern research results in computability theory, A Hierarchy of Turing Degrees establishes novel directions in the field.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru