Technical Reports

  1. Marco Kuhlmann, Giorgio Satta, and Peter Jonsson: On the Complexity of CCG Parsing. arXiv:1702.06594, 2017. link

  1. Peter Jonsson and Johan Thapper: Constraint Satisfaction and Semilinear Expansions of Addition over the Rationals and the Reals. arXiv:1506.00479, 2015. link

  2. Peter Jonsson and Marco Kuhlmann: Maximum Pagenumber-k Subgraph is NP-complete. arXiv:1504.05908, 2015. link

  3. Christian Glaßer, Peter Jonsson, and Barnaby Martin: Constraint Satisfaction Problems around Skolem Arithmetic. arXiv:1504.04181, 2015. link

  4. Manuel Bodirsky, Peter Jonsson, and Trung Van Pham: The Complexity of Phylogeny Constraint Satisfaction. arXiv:1503.07310, 2015. link

  1. Manuel Bodirsky, Peter Jonsson, and Trung Van Pham: The Reducts of the Homogeneous Binary Branching C-relation. arXiv:1408.2554, 2014. link

  1. Peter Jonsson and Paolo Liberatore: On the Complexity of Finding Satisfiable Subinstances in Constraint Satisfaction. Electronic Colloquium on Computational Complexity, report TR99-038, 1999. link