Editors:
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 6175)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Conference series link(s): SAT: International Conference on Theory and Applications of Satisfiability Testing
Conference proceedings info: SAT 2010.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsThis is a preview of subscription content, access via your institution.
Table of contents (37 papers)
-
Front Matter
-
Part 2. Regular Papers
Keywords
- MiniSAT
- SAT algorithms
- SAT complexity
- SAT translation
- algorithms
- combinatorics
- complexity
- computational complexity
- distributed algorithms
- k-SAT
- logic
- polynomial time reduction
- proof complexity
- satisfiability testing
- structured analysis
- algorithm analysis and problem complexity
Editors and Affiliations
-
Technion, Technion City, Haifa, Israel
Ofer Strichman
-
Vienna University of Technology, Vienna, Austria
Stefan Szeider
Bibliographic Information
Book Title: Theory and Applications of Satisfiability Testing - SAT 2010
Book Subtitle: 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010, Proceedings
Editors: Ofer Strichman, Stefan Szeider
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-642-14186-7
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag Heidelberg Berlin 2010
Softcover ISBN: 978-3-642-14185-0Published: 30 June 2010
eBook ISBN: 978-3-642-14186-7Published: 09 July 2010
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XIII, 400
Number of Illustrations: 74 b/w illustrations
Topics: Algorithms, Software Engineering, Programming Techniques, Computer Science Logic and Foundations of Programming, Formal Languages and Automata Theory, Mathematics of Computing