40,95 €
40,95 €
inkl. MwSt.
Sofort per Download lieferbar
20 °P sammeln
40,95 €
Als Download kaufen
40,95 €
inkl. MwSt.
Sofort per Download lieferbar
20 °P sammeln
Jetzt verschenken
Alle Infos zum eBook verschenken
40,95 €
inkl. MwSt.
Sofort per Download lieferbar
Alle Infos zum eBook verschenken
20 °P sammeln
Andere Kunden interessierten sich auch für
![Logic, Language, Information, and Computation (eBook, PDF)]( "Logic, Language, Information, and Computation (eBook, PDF)")
Logic, Language, Information, and Computation (eBook, PDF)40,95 €![Theory and Applications of Satisfiability Testing - SAT 2010 (eBook, PDF)]( "Theory and Applications of Satisfiability Testing - SAT 2010 (eBook, PDF)")
Theory and Applications of Satisfiability Testing - SAT 2010 (eBook, PDF)40,95 €![Algorithmic Learning Theory (eBook, PDF)]( "Algorithmic Learning Theory (eBook, PDF)")
Algorithmic Learning Theory (eBook, PDF)40,95 €![Hybrid Artificial Intelligent Systems (eBook, PDF)]( "Hybrid Artificial Intelligent Systems (eBook, PDF)")
Hybrid Artificial Intelligent Systems (eBook, PDF)40,95 €![Artificial Intelligence and Computational Intelligence (eBook, PDF)]( "Artificial Intelligence and Computational Intelligence (eBook, PDF)")
Artificial Intelligence and Computational Intelligence (eBook, PDF)40,95 €![Algorithms in Bioinformatics (eBook, PDF)]( "Algorithms in Bioinformatics (eBook, PDF)")
Algorithms in Bioinformatics (eBook, PDF)40,95 €![Research in Computational Molecular Biology (eBook, PDF)]( "Research in Computational Molecular Biology (eBook, PDF)")
Research in Computational Molecular Biology (eBook, PDF)40,95 €
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.
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.
Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.