menu
{ "item_title" : "Theory and Applications of Satisfiability Testing - SAT 2010", "item_author" : [" Ofer Strichman", "Stefan Szeider "], "item_description" : "This book constitutes the refereed proceedings of the 13th International Conference on Theory and Applications of Satisfiability Testing, SAT 2010, held in Edinburgh, UK, in July 2010 as part of the Federated Logic Conference, FLoC 2010. The 21 revised full papers presented together with 14 revised short papers and 2 invited talks were carefully selected from 75 submissions. The papers cover a broad range of topics such as proof systems and proof complexity; search algorithms and heuristics; analysis of algorithms; combinatorial theory of satisfiability; random instances vs structured instances; problem encodings; industrial applications; applications to combinatorics; solvers, simplifiers and tools; and exact and parameterized algorithms.", "item_img_path" : "https://covers3.booksamillion.com/covers/bam/3/64/214/185/3642141854_b.jpg", "price_data" : { "retail_price" : "54.99", "online_price" : "54.99", "our_price" : "54.99", "club_price" : "54.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Theory and Applications of Satisfiability Testing - SAT 2010|Ofer Strichman

Theory and Applications of Satisfiability Testing - SAT 2010 : 13th International Conference, SAT 2010, Edinburgh, Uk, July 11-14, 2010, Proceedings

local_shippingShip to Me
On Order. Usually ships in 2-4 weeks
FREE Shipping for Club Members help

Overview

This book constitutes the refereed proceedings of the 13th International Conference on Theory and Applications of Satisfiability Testing, SAT 2010, held in Edinburgh, UK, in July 2010 as part of the Federated Logic Conference, FLoC 2010. The 21 revised full papers presented together with 14 revised short papers and 2 invited talks were carefully selected from 75 submissions. The papers cover a broad range of topics such as proof systems and proof complexity; search algorithms and heuristics; analysis of algorithms; combinatorial theory of satisfiability; random instances vs structured instances; problem encodings; industrial applications; applications to combinatorics; solvers, simplifiers and tools; and exact and parameterized algorithms.

This item is Non-Returnable

Details

  • ISBN-13: 9783642141850
  • ISBN-10: 3642141854
  • Publisher: Springer
  • Publish Date: June 2010
  • Dimensions: 9.3 x 6.1 x 0.9 inches
  • Shipping Weight: 1.35 pounds
  • Page Count: 400

Related Categories

You May Also Like...

    1

BAM Customer Reviews