Library of American University of Madaba
Your cart is empty.
Marx, Dániel.
Parameterized and Exact Computation 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers / [electronic resource] : edited by Dániel Marx, Peter Rossmanith. - VIII, 273p. 28 illus. online resource. - Lecture Notes in Computer Science, 7112 0302-9743 ; .
This book constitutes the thoroughly refereed post-conference proceedings of the 6th International Symposium on Parameterized and Exact Computation, IPEC 2011, in Saarbrücken, Germany, in September 2011. The 21 revised full papers presented were carefully reviewed and selected from 40 submissions. The topics addressed cover research in all aspects of parameterized and exact computation and complexity, including but not limited to new techniques for the design and analysis of parameterized and exact algorithms, fixed-parameter tractability results, parameterized complexity theory, relationship between parameterized complexity and traditional complexity classifications, applications of parameterized and exact computation, and implementation issues of parameterized and exact algorithms.
9783642280504
Computer science.
Information theory.
Computer software.
Computational complexity.
Algebra--Data processing.
Algorithms.
Computer Science.
Algorithm Analysis and Problem Complexity.
Algorithms.
Discrete Mathematics in Computer Science.
Theory of Computation.
Symbolic and Algebraic Manipulation.
Computation by Abstract Devices.
QA76.9.A43
005.1
Parameterized and Exact Computation 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers / [electronic resource] : edited by Dániel Marx, Peter Rossmanith. - VIII, 273p. 28 illus. online resource. - Lecture Notes in Computer Science, 7112 0302-9743 ; .
This book constitutes the thoroughly refereed post-conference proceedings of the 6th International Symposium on Parameterized and Exact Computation, IPEC 2011, in Saarbrücken, Germany, in September 2011. The 21 revised full papers presented were carefully reviewed and selected from 40 submissions. The topics addressed cover research in all aspects of parameterized and exact computation and complexity, including but not limited to new techniques for the design and analysis of parameterized and exact algorithms, fixed-parameter tractability results, parameterized complexity theory, relationship between parameterized complexity and traditional complexity classifications, applications of parameterized and exact computation, and implementation issues of parameterized and exact algorithms.
9783642280504
Computer science.
Information theory.
Computer software.
Computational complexity.
Algebra--Data processing.
Algorithms.
Computer Science.
Algorithm Analysis and Problem Complexity.
Algorithms.
Discrete Mathematics in Computer Science.
Theory of Computation.
Symbolic and Algebraic Manipulation.
Computation by Abstract Devices.
QA76.9.A43
005.1