Cantitate/Preț
Produs

Parameterized and Exact Computation: 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers: Lecture Notes in Computer Science, cartea 7112

Editat de Dániel Marx, Peter Rossmanith
en Limba Engleză Paperback – 16 mar 2012
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 40934 lei

Preț vechi: 51168 lei
-20% Nou

Puncte Express: 614

Preț estimativ în valută:
7834 8137$ 6507£

Carte disponibilă

Livrare economică 11-25 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642280498
ISBN-10: 3642280498
Pagini: 281
Ilustrații: VIII, 273 p. 28 illus.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.42 kg
Ediția:2012
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Textul de pe ultima copertă

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.

Caracteristici

Fast track conference proceedings State of the art research Up to date results