Why are CSPs Based on Partition Schemes Computationally Hard?

Peter Jonsson, Victor Lagerkvist. Why are CSPs Based on Partition Schemes Computationally Hard?. In Igor Potapov, Paul G. Spirakis, James Worrell 0001, editors, 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK. Volume 117 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. [doi]

Authors

Peter Jonsson

This author has not been identified. Look up 'Peter Jonsson' in Google

Victor Lagerkvist

This author has not been identified. Look up 'Victor Lagerkvist' in Google