Cantitate/Preț
Produs

Parameterized and Exact Computation

Editat de Marek Cygan, Pinar Heggernes
en Limba Engleză Paperback – 12 dec 2014
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.
Citește tot Restrânge

Preț: 32403 lei

Preț vechi: 40504 lei
-20% Nou

Puncte Express: 486

Preț estimativ în valută:
5734 6687$ 5034£

Carte tipărită la comandă

Livrare economică 16-30 ianuarie 26

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783319135236
ISBN-10: 3319135236
Pagini: 356
Ilustrații: IX, 343 p. 37 illus.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.54 kg
Ediția:2014
Editura: Springer
Locul publicării:Cham, Switzerland

Public țintă

Research

Cuprins

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.

Textul de pe ultima copertă

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.

Caracteristici

Includes supplementary material: sn.pub/extras