Articoli correlati a Satisfiability Problem: Theory and Applications
Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Risultati della ricerca per Satisfiability Problem: Theory and Applications
Foto dell'editore
Satisfiability Problem
Editore:
American Mathematical Society, 1997
ISBN 10: 0821804790
ISBN 13: 9780821804797
Antico o usato
Rilegato
Da: Buchpark, Trebbin, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: Gut. Zustand: Gut | Seiten: 724 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar. Codice articolo 33291352/3
Compra usato
EUR 94,21
Spedizione EUR 105,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 2 disponibili
Foto dell'editore
Satisfiability Problem Theory and Applications
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: Brand New. 724 pages. 10.50x7.50x1.75 inches. In Stock. Codice articolo __0821804790
Compra nuovo
EUR 227,72
Spedizione EUR 17,55
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 2 disponibili
Foto dell'editore
Satisfiability Problem
Editore:
American Mathematical Society, US, 1997
ISBN 10: 0821804790
ISBN 13: 9780821804797
Nuovo
Rilegato
Da: Rarewaves.com USA, London, LONDO, Regno Unito
Valutazione del venditore 5 su 5 stelle
Hardback. Condizione: 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. Codice articolo LU-9780821804797
Compra nuovo
EUR 252,61
Spedizione gratuita
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Satisfiability Problem
Editore:
American Mathematical Society, US, 1997
ISBN 10: 0821804790
ISBN 13: 9780821804797
Nuovo
Rilegato
Da: Rarewaves.com UK, London, Regno Unito
Valutazione del venditore 5 su 5 stelle
Hardback. Condizione: 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. Codice articolo LU-9780821804797
Compra nuovo
EUR 233,72
Spedizione EUR 76,04
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Satisfiability Problem: Theory and Applications (Dimacs Series in Discrete Mathematics and Theoretical Computer Science)
Da: Kennys Bookstore, Olney, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: 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. Codice articolo V9780821804797
Compra nuovo
EUR 324,43
Spedizione EUR 9,08
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Satisfiability Problem: Theory and Applications (Dimacs Series in Discrete Mathematics and Theoretical Computer Science)
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Valutazione del venditore 5 su 5 stelle
Condizione: 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. . . . . Codice articolo V9780821804797
Compra nuovo
EUR 374,20
Spedizione EUR 9,50
Spedito da Irlanda a U.S.A.
Spedito da Irlanda a U.S.A.
Quantità: 1 disponibili