The 6th International Computer Science Symposium in Russia
June 14–18, 2011, St. Petersburg, Russia
MyCSRSuckerfishMenu
Call for Papers
Program
Invited Speakers
Workshops
Committees
Proceedings
Venue
Practical Info
Photos
A Polynomial-Time Algorithm for Finding Minimal Conflicting Sets
Talk:
Guillaume Blin, Romeo Rizzi and Stephane Vialette. A Polynomial-Time Algorithm for Finding Minimal Conflicting Sets
Date:
Fri, 06/17/2011 - 16:30
Slides:
CSR2011_June17_16_30_Blin.pdf
Submitted by kulikov on Fri, 06/17/2011 - 11:47