People
Research
Courses
Updates
Jobs
Contact
Internal
Light
Dark
Automatic
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width
Robert Ganian
January 2013
Cite
Type
Journal Article
Robert Ganian
Robert Ganian is a Professor at the Algorithms and Complexity Group.
Cite
×