Ditemukan 1 dokumen yang sesuai dengan query
Creignou, Nadia, author
Many fundamental combinatorial problems, arising in such diverse fields as artificial intelligence, logic, graph theory, and linear algebra, can be formulated as Boolean constraint satisfaction problems (CSP). This book is devoted to the study of the complexity of such problems. The authors' goal is to develop a framework for classifying...
Philadelphia : Society for Industrial and Applied Mathematics, 2001
e20442783
eBooks Universitas Indonesia Library
