ISBN: 9783642215803 - theory and application of satisfiability testing: 14th international conference, sat 2011, ann arbor, mi, usa, june 19-22, 2011, proceedings: 6695 (lecture notes in computer science, 6695) (7 resultados)

Condición: As New. Unread book in perfect condition.

Condición: New.

Paperback. Condición: new. Paperback. 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. Constitutes the refereed proceedings of the 14th International Conference on Theory and Applications of Satisfiability Testing, SAT 2011, that was held in Ann Arbor, MI, USA. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.…

Condición: New. pp. xii + 380 63 Illus. (28 Col.).

Paperback. Condición: Brand New. 2011 edition. 384 pages. 9.25x6.00x1.00 inches. In Stock.

Condición: New. Up-to-date resultsFast track conference proceedingsState-of-the-art reportThis book constitutes the refereed proceedings of the 14th International Conference on Theory and Applications of Satisfiability Testing, SAT 2011, held in.

Taschenbuch. Condición: Neu. Neuware - 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.…