An excursion into Markov chains - UNITEXT
Tipsa dina vänner om produkten:
Beställningsvara
Julklappar kan bytas fram till 31:e januari
This book provides a significant step towards bridging the areas of Boolean satisfiability and constraint satisfaction by answering the question why SAT-solvers are efficient on certain classes of CSP instances which are hard to solve for standard constraint solvers.
113 pages, 13 Tables, black and white; 19 Illustrations, black and white; XI, 113 p. 19 illus.
| Media | Böcker Pocketbok (Bok med mjukt omslag och limmad rygg) |
| Releasedatum | 22 oktober 2016 |
| ISBN13 | 9783319373645 |
| Utgivare | Springer International Publishing AG |
| Antal sidor | 113 |
| Mått | 150 × 220 × 10 mm · 190 g |