1 option
Parameterized and Exact Computation : 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers / edited by Marek Cygan, Pinar Heggernes.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 8894
- Theoretical Computer Science and General Issues, 2512-2029 ; 8894
- Language:
- English
- Subjects (All):
- Computer science.
- Algorithms.
- Computer science-Mathematics.
- Discrete mathematics.
- Computer Science.
- Discrete Mathematics in Computer Science.
- Mathematical Applications in Computer Science.
- Local Subjects:
- Computer Science.
- Algorithms.
- Discrete Mathematics in Computer Science.
- Mathematical Applications in Computer Science.
- Physical Description:
- 1 online resource (IX, 343 pages) : 37 illustrations
- Edition:
- 1st ed. 2014.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2014.
- System Details:
- text file PDF
- Summary:
- 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. The 27 revised full papers presented together with one invited paper were carefully reviewed and selected from 42 submissions. The topics addressed cover research in all aspects of parameterized/exact algorithms and complexity including but are 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 exponential-time computation; and implementation issues of parameterized and exact exponential-time algorithms.
- Contents:
- Fixed-parameter tractability results
- Parameterized complexity theory
- Relationship between parameterized complexity and traditional complexity classifications.-Applications of parameterized and exact exponential-time computation.- Implementation issues of parameterized and exact exponential-time algorithms.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-319-13524-3
- 9783319135243
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.