Team
Research
Courses
News
Jobs
Contact
Internal
Light
Dark
Automatic
Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications
Iyad A. Kanj
,
Stefan Szeider
January 2014
PDF
Cite
DOI
Type
Conference Paper
Stefan Szeider
Head of Research Unit
Stefan Szeider is a Professor at the Algorithms and Complexity Group.
Cite
×