Bemærk: Kan ikke leveres før jul.
Forventes på lager: 22-10-2016
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.
| Forlag | Springer International Publishing AG |
| Forfatter | Justyna Petke |
| Type | Bog |
| Format | Paperback / softback |
| Sprog | Engelsk |
| Udgave | Softcover reprint of the original 1st ed. 2015 |
| Udgivelsesdato | 22-10-2016 |
| Første udgivelsesår | 2016 |
| Serie | Artificial Intelligence: Foundations, Theory, and Algorithms |
| Illustrationer | 19 Illustrations, black and white; XI, 113 p. 19 illus. |
| Originalsprog | Switzerland |
| Sideantal | 113 |
| Indbinding | Paperback / softback |
| Forlag | Springer International Publishing AG |
| Sideoplysninger | 113 pages, 19 Illustrations, black and white; XI, 113 p. 19 illus. |
| Mål | 235 x 155 |
| ISBN-13 / EAN-13 | 9783319373645 |