Parameterized and Exact Computation [electronic resource] : 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers / edited by Dániel Marx, Peter Rossmanith.
By: Marx, Dániel [editor.].
Contributor(s): Rossmanith, Peter [editor.] | SpringerLink (Online service).
Material type:
BookSeries: Lecture Notes in Computer Science: 7112Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2012Description: VIII, 273p. 28 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642280504.Subject(s): 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 DevicesDDC classification: 005.1 Online resources: Click here to access online
In:
Springer eBooksSummary: 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.
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.
There are no comments for this item.