617-759-1814 
Parameterized and Exact Computation (PDF - Version)
Viewing This Product
4 Great reasons to buy from us:
-
Secure Ordering -
365-Day Money-Back Guarantee -
100% Satisfaction Guaranteed -
Easy Returns
- Delivery by email. Can be DOWNLOAD IMMEDIATELY after purchasing.
- PDF eBook eTextbook Only! NO Online Access. NO Physical Book, Can be read on any devices (Kindle, NOOK, Android/IOS devices, Windows, MAC).
- WE NOW ACCEPT CREDIT CARD, PAYPAL payments
- If you need EPUB Version, please contact to us
This book constitutes the thoroughly refereed post-conference proceedings of the 8th International Symposium on Parameterized and Exact Computation, IPEC 2013, in Sophia Antipolis, France, in September 2013.
The 29 revised full papers presented were carefully reviewed and selected from 58 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 computation, and implementation issues of parameterized and exact algorithms.
Estimated between and
Will usually ship within 1 business day.- Delivery by email. Can be DOWNLOAD IMMEDIATELY after purchasing.
- PDF eBook eTextbook Only! NO Online Access. NO Physical Book, Can be read on any devices (Kindle, NOOK, Android/IOS devices, Windows, MAC).
- WE NOW ACCEPT CREDIT CARD, PAYPAL payments
- If you need EPUB Version, please contact to us
This book constitutes the thoroughly refereed post-conference proceedings of the 8th International Symposium on Parameterized and Exact Computation, IPEC 2013, in Sophia Antipolis, France, in September 2013.
The 29 revised full papers presented were carefully reviewed and selected from 58 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 computation, and implementation issues of parameterized and exact algorithms.
Estimated between and
Will usually ship within 1 business day.