Название: The Art of Computer Programming, Volume 4, Fascicle 7, Constraint Satisfaction
Автор: Donald E. Knuth
Издательство: Pearson Education, Inc.
Год: 2025
Страниц: 462
Язык: английский
Формат: pdf, epub
Размер: 24.4 MB
Volume 4, Fascicle 7, which is brimming with lively examples, forms the first third of what will eventually become hardcover Volume 4C. It introduces and explores an important general framework for modeling and solving combinatorial problems, called the Constraint Satisfaction Problem (CSP). The concluding sections of Volume 4B contain expositions of two analogous frameworks, namely XCC (“exact covering with colors”) and SAT (“Boolean satisfiability”); the XCC solvers and SAT solvers are now joined by CSP solvers, completing a powerful trio of techniques. Each member of the trio has its own strengths, while separately helping to understand the other two. This fascicle illuminates how the CSP framework is tied to dozens of other parts of Computer Science: Scene analysis (computer vision); efficient algorithms that embed one graph in another; fascinating instances of “graceful graphs”; new ways to look ahead when backtracking; new heuristics to guide a search that backtracks through a massive space of possibilities; situations when backtracking isn’t necessary.
Название: Australian Cupcakes & Inspirations 
