List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| On the complexity of submodular function minimisation on diamonds Discrete Optimization | 2012-03-07 | Paper |
| Min CSP on four elements: moving beyond submodularity Principles and Practice of Constraint Programming – CP 2011 | 2011-09-23 | Paper |
| Hard constraint satisfaction problems have hard gaps at location 1 Theoretical Computer Science | 2009-09-10 | Paper |
| MAX ONES Generalized to Larger Domains SIAM Journal on Computing | 2009-03-16 | Paper |
| Approximability of Integer Programming with Generalised Constraints Principles and Practice of Constraint Programming - CP 2006 | 2008-09-09 | Paper |
| Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems Computer Science – Theory and Applications | 2008-06-03 | Paper |
| Approximability of Bounded Occurrence Max Ones Lecture Notes in Computer Science | 2007-09-05 | Paper |
| Mathematical Foundations of Computer Science 2005 Lecture Notes in Computer Science | 2006-10-20 | Paper |
Research outcomes over time
This page was built for person: Fredrik Kuivinen
