( en | de | ru )

 

Disambiguation of "Szeider, Stefan"

Author of the publication

copydeleteadd this publication to your clipboard
Finding the Hardest Formulas for Resolution.

, and . J. Artif. Intell. Res., (2021)

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 Fröhlich

Modellbasierte Fehlererkennung und Diagnose in Echtzeit am Beispiel einer Brennstoffzelle. Uni Kassel, (2009)

Stefan Tripmaker

Verhältnis und Abgrenzung zwischen Steuerhinterziehung und Betrug. Bucerius Law School Hamburg, (2007)

Stefan Kutter

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

Other publications of authors with the same name

Parameterized SAT.. Encyclopedia of Algorithms, (2016)Algorithms and Complexity Results for Exact Bayesian Structure Learning, and . CoRR, (2012)A Complete Parameterized Complexity Analysis of Bounded Planning., , , and . CoRR, (2013)Guarantees and Limits of Preprocessing in Constraint Satisfaction and Reasoning., and . CoRR, (2014)Algorithms and complexity results for persuasive argumentation., , and . Artif. Intell., 175 (9-10): 1722-1736 (2011)Finding the Hardest Formulas for Resolution., and . CP, volume 12333 of Lecture Notes in Computer Science, page 514-530. Springer, (2020)Breaking Symmetries with RootClique and LexTopSort., , and . CP, volume 12333 of Lecture Notes in Computer Science, page 286-303. Springer, (2020)Circuit Treewidth, Sentential Decision, and Query Compilation., and . PODS, page 233-246. ACM, (2017)Constraint Satisfaction with Bounded Treewidth Revisited., and . CP, volume 4204 of Lecture Notes in Computer Science, page 499-513. Springer, (2006)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)