Team
Research
Courses
News
Jobs
Contact
Internal
Light
Dark
Automatic
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width
Robert Ganian
January 2010
Cite
Type
Conference Paper
Robert Ganian
Robert Ganian is a Professor at the Algorithms and Complexity Group.
Cite
×