( en | de | ru )

 

Disambiguation of "Jonsson, Peter"

Author of the publication

copydeleteadd this publication to your clipboard
Determining the Number of Solutions to Binary CSP Instances.

, , , and . CP, volume 2470 of Lecture Notes in Computer Science, page 327-340. Springer, (2002)

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. You can also use the button next to the name to display some publications already assigned to the person.

Hans-Peter Jönsson

Claus Jönsson

Franziska Jönsson

Jan Jonsson

Ingimar Jónsson

 

Other publications of authors with the same name

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