( en | de | ru )

 

Disambiguation of "Szeider, Stefan"

Author of the publication

copydeleteadd this publication to your clipboard
Backdoors into Heterogeneous Classes of SAT and CSP.

, , , , and . AAAI, page 2652-2658. AAAI Press, (2014)

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 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)
 

Other publications of authors with the same name

On Theorems Equivalent with Kotzig's Result on Graphs with Unique 1-Factors.. Ars Comb., (2004)Proof Complexity of Fragments of Long-Distance Q-Resolution., , and . SAT, volume 11628 of Lecture Notes in Computer Science, page 319-335. Springer, (2019)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)A SAT Approach to Clique-Width., and . SAT, volume 7962 of Lecture Notes in Computer Science, page 318-334. Springer, (2013)Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems., and . Comput. J., 51 (3): 303-325 (2008)Short Q-Resolution Proofs with Homomorphisms., , and . SAT, volume 12178 of Lecture Notes in Computer Science, page 412-428. Springer, (2020)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)