Two papers accepted to CP 2012
Posted: 12th June 2012
Two papers co-authored by Standa Zivny, a Junior Research Fellow at Oxford's University College and member of the Dept.
of Computer Science, have been accepted to the 18th International Conference on Principles and Practice of Constraint Programming
The papers are:
'A characterisation of the complexity of forbidding subproblems in binary' Max-CSP, by M. Cooper (Toulouse), G. Escamocher (Toulouse), and S. Zivny.
'Relating proof complexity measures and practical hardness of SAT', by M. Järvisalo (Helsinki), A. Matsliah (IBM Research), J. Nordström (KTH) and S. Zivny.
The conference will be held in Quebec City, Canada in October.