Computer Science – Computational Complexity
Scientist
Computer Science
Computational Complexity
Scientist
Approximability Distance in the Space of H-Colourability Problems
Approximability of Integer Programming with Generalised Constraints
Graph Homomorphisms, Circular Colouring, and Fractional Covering by H-cuts
Hard constraint satisfaction problems have hard gaps at location 1
Horn versus full first-order: complexity dichotomies in algebraic constraint satisfaction
No associations
LandOfFree
Peter Jonsson does not yet have a rating. At this time, there are no reviews or comments for this scientist.
If you have personal experience with Peter Jonsson, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Peter Jonsson will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-P-202340