( en | de | ru )

 

Disambiguation of "Szeider, Stefan"

Author of the publication

copydeleteadd this publication to your clipboard
SAT Encodings and Beyond (Dagstuhl Seminar 23261).

, , , and . Dagstuhl Reports, 13 (6): 106-122 (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Stefan Schwärzler

Graphische Modelle im natürlichsprachlichen Mensch-Maschine-Dialog. TU München, (2010)

Stefan Weiß

Deformation quantization of principal fibre bundles and classical gauge theories. Uni Freiburg, (2009)

Stefan Reisbacher

Funktionelle Analyse von Cryptochrom 3 aus Arabidopsis thaliana. Uni Marburg, (2009)

Stefan Kutter

Molekularer Aufbau und Translokationsmechanismus des Cag-Typ-IV-Sekretionssystems von Helicobacter pylori. Uni München, (2009)

Stefan Padberg

Der Einsatz des Internets im Geographieunterricht: Meinungsbilder und Unterrichtsbeobachtungen. Uni Köln, (2009)
 

Other publications of authors with the same name

The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT.. SAT, volume 5584 of Lecture Notes in Computer Science, page 276-283. Springer, (2009)A SAT Approach to Clique-Width., and . SAT, volume 7962 of Lecture Notes in Computer Science, page 318-334. Springer, (2013)Model Checking Existential Logic on Partially Ordered Sets., , and . ACM Trans. Comput. Log., 17 (2): 10 (2016)A SAT Approach to Branchwidth., , and . ACM Trans. Comput. Log., 20 (3): 15:1-15:24 (2019)Proof Complexity of Fragments of Long-Distance Q-Resolution., , and . SAT, volume 11628 of Lecture Notes in Computer Science, page 319-335. Springer, (2019)Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems., and . Comput. J., 51 (3): 303-325 (2008)On Existential MSO and its Relation to ETH., , , and . MFCS, volume 58 of LIPIcs, page 42:1-42:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Parameterized complexity classes beyond para-NP., and . J. Comput. Syst. Sci., (2017)Detecting Backdoor Sets with Respect to Horn and Binary Clauses., , and . SAT, (2004)Matched Formulas and Backdoor Sets.. SAT, volume 4501 of Lecture Notes in Computer Science, page 94-99. Springer, (2007)