( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Characterisation of the Complexity of Forbidding Subproblems in Binary Max-CSP.

, , и . CP, том 7514 из Lecture Notes in Computer Science, стр. 265-273. Springer, (2012)

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.

Cooper Baker

Jason Cooper

Simon Cooper

Maria Cooper

Sam Cooper

 

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

Tractable Monotone Temporal Planning., , и . ICAPS, AAAI, (2012)The tractability of CSP classes defined by forbidden patterns, , , и . CoRR, (2011)Monotone Temporal Planning: Tractability, Extensions and Applications - (Extended Abstract)., , и . CP, том 8656 из Lecture Notes in Computer Science, стр. 928-932. Springer, (2014)Domain Reduction for Valued Constraints by Generalising Methods from CSP., , и . CP, том 11008 из Lecture Notes in Computer Science, стр. 64-80. Springer, (2018)A Characterisation of the Complexity of Forbidding Subproblems in Binary Max-CSP., , и . CP, том 7514 из Lecture Notes in Computer Science, стр. 265-273. Springer, (2012)Binary constraint satisfaction problems defined by excluded topological minors., , , и . Inf. Comput., (2019)Hybrid Tractable Classes of Constraint Problems., и . The Constraint Satisfaction Problem, том 7 из Dagstuhl Follow-Ups, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Efficient systematic analysis of occlusion.. Pattern Recognit. Lett., 7 (4): 259-264 (1988)Transformation de problèmes de planification optimale., , и . Rev. d'Intelligence Artif., 24 (4): 465-484 (2010)An Optimal k-Consistency Algorithm.. Artif. Intell., 41 (1): 89-95 (1989)