( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The tractability of CSP classes defined by forbidden patterns

, , , и . CoRR, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

David Isaac Cohen

Clemens David Cohen

David Cohen-Steiner

lin A David

David A Traill

 

Другие публикации лиц с тем же именем

Domain permutation reduction for constraint satisfaction problems., и . Artif. Intell., 172 (8-9): 1094-1118 (2008)Characterising Tractable Constraints., , и . Artif. Intell., 65 (2): 347-361 (1994)The Complexity of Constraint Languages., и . Handbook of Constraint Programming, том 2 из Foundations of Artificial Intelligence, Elsevier, (2006)A Unifying Theory of Structural Decompostions for the Constraint Satisfaction Problems., , и . Complexity of Constraints, том 06401 из Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, (2006)On Exact Specification by Examples., , , и . COLT, стр. 311-318. ACM, (1992)Tractability by Approximating Constraint Languages., и . CP, том 2833 из Lecture Notes in Computer Science, стр. 392-406. Springer, (2003)Tractable Disjunctive Constraints., , и . CP, том 1330 из Lecture Notes in Computer Science, стр. 478-490. Springer, (1997)An Algebraic Characterisation of Complexity for Valued Constraint., , и . CP, том 4204 из Lecture Notes in Computer Science, стр. 107-121. Springer, (2006)A Substitution Operation for Constraints., , и . PPCP, том 874 из Lecture Notes in Computer Science, стр. 1-9. Springer, (1994)Derivation of Constraints and Database Relations., , и . CP, том 1118 из Lecture Notes in Computer Science, стр. 134-148. Springer, (1996)