( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Time Complexity of Constraint Satisfaction via Universal Algebra.

, , и . MFCS, том 83 из LIPIcs, стр. 17:1-17:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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.

Hans-Peter Jönsson

Claus Jönsson

Franziska Jönsson

Jan Jonsson

Ingimar Jónsson

 

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

A Nonapproximability Result for Finite Function Generation.. Inf. Process. Lett., 63 (3): 143-145 (1997)The approximability of MAX CSP with fixed-value constraints, , , и . CoRR, (2006)Approximability Distance in the Space of H-Colourability Problems, , и . CoRR, (2008)Bounded Tree-Width and CSP-Related Problems., и . ISAAC, том 4835 из Lecture Notes in Computer Science, стр. 632-643. Springer, (2007)Introduction to the Maximum SolutionProblem., и . Complexity of Constraints, том 5250 из Lecture Notes in Computer Science, стр. 255-282. Springer, (2008)Approximability of Integer Programming with Generalised Constraints., , и . CP, том 4204 из Lecture Notes in Computer Science, стр. 256-270. Springer, (2006)Upper and Lower Bounds on the Time Complexity of Infinite-Domain CSPs., и . CP, том 9255 из Lecture Notes in Computer Science, стр. 183-199. Springer, (2015)Planning with Abstraction Hierarchies can be Exponentially Less Efficient., и . IJCAI, стр. 1599-1605. Morgan Kaufmann, (1995)A Complete Classification of Tractability in RCC-5, и . CoRR, (1997)Almost Consistent Systems of Linear Equations., , , , и . CoRR, (2022)