Nadia Creignou – författare
Visar alla böcker från författaren Nadia Creignou. Handla med fri frakt och snabb leverans.
5 produkter
Complexity Classifications of Boolean Constraint Satisfaction Problems
Av Nadia Creignou, Sanjeev Khanna m. fl.
Inbunden, 2001
1076 kr
Lägg i varukorg
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 …
Theory and Applications of Satisfiability Testing – SAT 2016
19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings
Av Nadia Creignou, Daniel Le Berre
Häftad, 2016
569 kr
Lägg i varukorg
This book constitutes the refereed proceedings of the 19th International Conference on Theory and Applications of Satisfiability Testing, SAT 2016, held in Bordeaux, France, in July 2016.The 31 regular papers, 5 tool papers presented together with 3 invited talks were carefully reviewed and …
Theory and Applications of Satisfiability Testing - SAT 2016
19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings
Av Daniel Le Berre, Nadia Creignou
E-bok, 2016
739 kr
Lägg i varukorg
This book constitutes the refereed proceedings of the 19th International Conference on Theory and Applications of Satisfiability Testing, SAT 2016, held in Bordeaux, France, in July 2016. The 31 regular papers, 5 tool papers presented together with 3 invited talks were carefully reviewed and …
Complexity of Constraints
An Overview of Current Research Themes
Av Nadia Creignou, Phokion G. Kolaitis m. fl.
Häftad, 2008
569 kr
Lägg i varukorg
Nowadays constraint satisfaction problems (CSPs) are ubiquitous in many different areas of computer science, from artificial intelligence and database systems to circuit design, network optimization, and theory of programming languages. Consequently, it is important to analyze and pinpoint the …
Complexity of Constraints
An Overview of Current Research Themes
Av Heribert Vollmer, Phokion G. Kolaitis m. fl.
E-bok, 2008
734 kr
Lägg i varukorg
Nowadays constraint satisfaction problems (CSPs) are ubiquitous in many different areas of computer science, from artificial intelligence and database systems to circuit design, network optimization, and theory of programming languages. Consequently, it is important to analyze and pinpoint the …
