Items related to Satisfiability Problem: Theory and Applications (DIMACS...
Satisfiability Problem: Theory and Applications (DIMACS SERIES IN DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE) - Hardcover
Synopsis
The 23 papers wrangle with a core of computationally intractable NP-complete problems, the solution to which is fundamental to automated reasoning, computer-aided design and manufacturing, machine vision, databases, robotics, scheduling, designing integrated circuits and computer architecture, and computer networking. Blending theory, algorithms, and applications, they discuss such topics as backtracking and probing, the relative size of certain polynomial time solvable subclasses of satisfiability, propositional search efficiency and first-order theorem proving, a discreet Lagrangian global-search method, a general stochastic approach to solving problems with hard and soft constraints, a better upper bound for the unsatisfiability threshold, and the local search for channel assignment in cellular mobile networks. Member prices are $119 for institutions and $89 for individuals. No index. Annotation c. by Book News, Inc., Portland, Or.
"synopsis" may belong to another edition of this title.
Search results for Satisfiability Problem: Theory and Applications (DIMACS...
Stock Image
Satisfiability Problem
Published by
American Mathematical Society, 1997
ISBN 10: 0821804790
ISBN 13: 9780821804797
Used
Hardcover
Seller: Buchpark, Trebbin, Germany
Seller rating 5 out of 5 stars
Condition: Gut. Zustand: Gut | Seiten: 724 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar. Seller Inventory # 33291352/3
Buy Used
US$ 112.25
US$ 121.46 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 2 available
Stock Image
Satisfiability Problem
Published by
American Mathematical Society, US, 1997
ISBN 10: 0821804790
ISBN 13: 9780821804797
New
Hardcover
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Seller rating 5 out of 5 stars
Hardback. Condition: New. The satisfiability (SAT) problem is central in mathematical logic, computing theory, and many industrial applications. There has been a strong relationship between the theory, the algorithms, and the applications of the SAT problem. This book aims to bring together work by the best theorists, algorithmists, and practitioners working on the SAT problem and on industrial applications, as well as to enhance the interaction between the three research groups. The book features the application of theoretical/algorithmic results to practical problems and presents practical problems for theoretical/algorithmic study.Major topics covered in the book include practical and industrial SAT problems and benchmarks, significant case studies and applications of the SAT problem and SAT algorithms, new algorithms and improved techniques for satisfiability testing, specific data structures and implementation details of the SAT algorithms, and the theoretical study of the SAT problem and SAT algorithms. It features: a comprehensive review of SAT research work over the past 25 years; the most recent research results; and a spectrum of algorithmic issues and applications. Seller Inventory # LU-9780821804797
Buy New
US$ 283.71
Free Shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Stock Image
Satisfiability Problem Theory and Applications
Published by
Amer Mathematical Society, 1997
ISBN 10: 0821804790
ISBN 13: 9780821804797
New
Hardcover
Seller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Hardcover. Condition: Brand New. 724 pages. 10.50x7.50x1.75 inches. In Stock. Seller Inventory # __0821804790
Buy New
US$ 263.42
US$ 20.30 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 2 available
Stock Image
Satisfiability Problem
Published by
American Mathematical Society, US, 1997
ISBN 10: 0821804790
ISBN 13: 9780821804797
New
Hardcover
Seller: Rarewaves.com UK, London, United Kingdom
Seller rating 5 out of 5 stars
Hardback. Condition: New. The satisfiability (SAT) problem is central in mathematical logic, computing theory, and many industrial applications. There has been a strong relationship between the theory, the algorithms, and the applications of the SAT problem. This book aims to bring together work by the best theorists, algorithmists, and practitioners working on the SAT problem and on industrial applications, as well as to enhance the interaction between the three research groups. The book features the application of theoretical/algorithmic results to practical problems and presents practical problems for theoretical/algorithmic study.Major topics covered in the book include practical and industrial SAT problems and benchmarks, significant case studies and applications of the SAT problem and SAT algorithms, new algorithms and improved techniques for satisfiability testing, specific data structures and implementation details of the SAT algorithms, and the theoretical study of the SAT problem and SAT algorithms. It features: a comprehensive review of SAT research work over the past 25 years; the most recent research results; and a spectrum of algorithmic issues and applications. Seller Inventory # LU-9780821804797
Buy New
US$ 270.36
US$ 87.96 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Stock Image
Satisfiability Problem: Theory and Applications (Dimacs Series in Discrete Mathematics and Theoretical Computer Science)
Published by
Amer Mathematical Society, 1997
ISBN 10: 0821804790
ISBN 13: 9780821804797
New
Hardcover
Seller: Kennys Bookstore, Olney, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. The satisfiability (SAT) problem is central in mathematical logic, computing theory, and many industrial applications. This book features the application of theoretical/algorithmic results to practical problems and presents practical problems for theoretical/algorithmic study. It also includes a spectrum of algorithmic issues and applications. Editor(s): Du, Ding-Zhu; Gu, Jun; Pardalos, Panos M. Series: Series in Discrete Mathematics & Theoretical Computer Science. Num Pages: 724 pages. BIC Classification: PBCD; UYA. Category: (P) Professional & Vocational. Dimension: 184 x 258 x 39. Weight in Grams: 1510. . 1997. Hardcover. . . . . Books ship from the US and Ireland. Seller Inventory # V9780821804797
Stock Image
Satisfiability Problem: Theory and Applications (Dimacs Series in Discrete Mathematics and Theoretical Computer Science)
Published by
Amer Mathematical Society, 1997
ISBN 10: 0821804790
ISBN 13: 9780821804797
New
Hardcover
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Seller rating 5 out of 5 stars
Condition: New. The satisfiability (SAT) problem is central in mathematical logic, computing theory, and many industrial applications. This book features the application of theoretical/algorithmic results to practical problems and presents practical problems for theoretical/algorithmic study. It also includes a spectrum of algorithmic issues and applications. Editor(s): Du, Ding-Zhu; Gu, Jun; Pardalos, Panos M. Series: Series in Discrete Mathematics & Theoretical Computer Science. Num Pages: 724 pages. BIC Classification: PBCD; UYA. Category: (P) Professional & Vocational. Dimension: 184 x 258 x 39. Weight in Grams: 1510. . 1997. Hardcover. . . . . Seller Inventory # V9780821804797
Buy New
US$ 445.86
US$ 10.99 shipping
Ships from Ireland to U.S.A.
Ships from Ireland to U.S.A.
Quantity: 1 available