Cantitate/Preț
Produs

Theory and Application of Satisfiability Testing: 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011, Proceedings: Lecture Notes in Computer Science, cartea 6695

Editat de Karem A. Sakallah, Laurent Simon
en Limba Engleză Paperback – iun 2011
This book constitutes the refereed proceedings of the 14th International Conference on Theory and Applications of Satisfiability Testing, SAT 2011, held in Ann Arbor, MI, USA in June 2011.
The 25 revised full papers presented together with abstracts of 2 invited talks and 10 poster papers were carefully reviewed and selected from 57 submissions. The papers are organized in topical sections on complexity analysis, binary decision diagrams, theoretical analysis, extraction of minimal unsatisfiable subsets, SAT algorithms, quantified Boolean formulae, model enumeration and local search, and empirical evaluation.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 33378 lei

Preț vechi: 41723 lei
-20% Nou

Puncte Express: 501

Preț estimativ în valută:
6388 6655$ 5311£

Carte disponibilă

Livrare economică 20 ianuarie-03 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642215803
ISBN-10: 3642215807
Pagini: 384
Ilustrații: XIII, 371 p. 63 illus., 28 illus. in color.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.61 kg
Ediția:2011
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 refereed proceedings of the 14th International Conference on Theory and Applications of Satisfiability Testing, SAT 2011, held in Ann Arbor, MI, USA in June 2011.
The 25 revised full papers presented together with abstracts of 2 invited talks and 10 poster papers were carefully reviewed and selected from 57 submissions. The papers are organized in topical sections on complexity analysis, binary decision diagrams, theoretical analysis, extraction of minimal unsatisfiable subsets, SAT algorithms, quantified Boolean formulae, model enumeration and local search, and empirical evaluation.

Caracteristici

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