Verwandte Artikel zu Satisfiability Problem: Theory and Applications (DIMACS...
Satisfiability Problem: Theory and Applications (DIMACS SERIES IN DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE) - Hardcover
Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Suchergebnisse für Satisfiability Problem: Theory and Applications (DIMACS...
Beispielbild für diese ISBN
Satisfiability Problem
Verlag:
American Mathematical Society, 1997
ISBN 10: 0821804790
ISBN 13: 9780821804797
Gebraucht
Hardcover
Anbieter: Buchpark, Trebbin, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: Gut. Zustand: Gut | Seiten: 724 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar. Bestandsnummer des Verkäufers 33291352/3
Gebraucht kaufen
EUR 94,21
EUR 105,00 Versand
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: 2 verfügbar
Beispielbild für diese ISBN
Satisfiability Problem Theory and Applications
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: Brand New. 724 pages. 10.50x7.50x1.75 inches. In Stock. Bestandsnummer des Verkäufers __0821804790
Neu kaufen
EUR 227,72
EUR 17,55 Versand
Versand von Vereinigtes Königreich nach USA
Versand von Vereinigtes Königreich nach USA
Anzahl: 2 verfügbar
Beispielbild für diese ISBN
Satisfiability Problem
Verlag:
American Mathematical Society, US, 1997
ISBN 10: 0821804790
ISBN 13: 9780821804797
Neu
Hardcover
Anbieter: Rarewaves.com USA, London, LONDO, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Hardback. Zustand: 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. Bestandsnummer des Verkäufers LU-9780821804797
Neu kaufen
EUR 252,61
Versand gratis
Versand von Vereinigtes Königreich nach USA
Versand von Vereinigtes Königreich nach USA
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Satisfiability Problem
Verlag:
American Mathematical Society, US, 1997
ISBN 10: 0821804790
ISBN 13: 9780821804797
Neu
Hardcover
Anbieter: Rarewaves.com UK, London, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Hardback. Zustand: 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. Bestandsnummer des Verkäufers LU-9780821804797
Neu kaufen
EUR 233,72
EUR 76,04 Versand
Versand von Vereinigtes Königreich nach USA
Versand von Vereinigtes Königreich nach USA
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Satisfiability Problem: Theory and Applications (Dimacs Series in Discrete Mathematics and Theoretical Computer Science)
Anbieter: Kennys Bookstore, Olney, MD, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: 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. Bestandsnummer des Verkäufers V9780821804797
Neu kaufen
EUR 324,43
EUR 9,08 Versand
Versand innerhalb von USA
Versand innerhalb von USA
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Satisfiability Problem: Theory and Applications (Dimacs Series in Discrete Mathematics and Theoretical Computer Science)
Anbieter: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irland
Verkäuferbewertung 5 von 5 Sternen
Zustand: 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. . . . . Bestandsnummer des Verkäufers V9780821804797
Neu kaufen
EUR 374,20
EUR 9,50 Versand
Versand von Irland nach USA
Versand von Irland nach USA
Anzahl: 1 verfügbar