Your search returned 3 results.

Sort
Results
1.
Complexity classifications of Boolean constraint satisfaction problems by Series: SIAM monographs on discrete mathematics and applications
Material type: Text Text; Format: print ; Literary form: Not fiction
Publication details: Philadelphia : Society for Industrial and Applied Mathematics, ©2001
Availability: Items available for loan: IIITD (1)Call number: REF 511.3 CRE-C.

2.
Complexity of Constraints [electronic resource] : An Overview of Current Research Themes / by Series: Theoretical Computer Science and General Issues ; 5250
Edition: 1st ed. 2008.
Material type: Text Text; Format: electronic available online remote; Literary form: Not fiction
Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2008 In: Springer Nature eBook
Availability: No items available.

3.
Theory and Applications of Satisfiability Testing – SAT 2016 [electronic resource] : 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings / by Series: Theoretical Computer Science and General Issues ; 9710
Edition: 1st ed. 2016.
Material type: Text Text; Format: electronic available online remote; Literary form: Not fiction
Publisher: Cham : Springer International Publishing : Imprint: Springer, 2016 In: Springer Nature eBook
Availability: No items available.

Pages
© 2024 IIIT-Delhi, library@iiitd.ac.in