Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width

Robert Ganian, Petr Hlinený, Jan Obdrzálek
January 2010
bib

Abstract

Full Citation:

Robert Ganian, Petr Hlinený, Jan Obdrzálek. Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, volume 8 of LIPIcs, pages 73–83, 2010, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.

Type
Conference Paper
Robert Ganian
Robert Ganian

Robert Ganian is a Professor at the Algorithms and Complexity Group.