Paper accepted to the ACM-SIAM Symposium on Discrete Algorithms (SODA)
Posted: 13th September 2011
'The complexity of conservative valued CSPs', written by Vladimir Kolmogorov (from IST, Austria's Institute of Science and Technology) and Oxford's Standa Živný, has been accepted for publication to the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).
SODA is the annual most prestigious conference on discrete algorithms in theoretical computer science. In 2012, the conference will be held in Kyoto, Japan.