( en | de | ru )

 

Disambiguation of "Scheder, Dominik"

Author of the publication

copydeleteadd this publication to your clipboard
PPSZ for General k-SAT - Making Hertli's Analysis Simpler and 3-SAT Faster.

, and . CCC, volume 79 of LIPIcs, page 9:1-9:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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.

Heinrich Scheder

Ernst Scheder

Hans Scheder

Regine Scheder

Thomas Scheder

 

Other publications of authors with the same name

Unsatisfiable Linear CNF Formulas Are Large, and Difficult to Construct Explicitely. CoRR, (2009)Improving PPSZ for 3-SAT using Crtitical Variables, , and . CoRR, (2010)PPSZ for k ≥ 5: More Is Better.. Electron. Colloquium Comput. Complex., (2018)PPSZ on CSP Instances with Multiple Solutions.. Electron. Colloquium Comput. Complex., (2018)Overlays and Limited Memory Communication., , and . CCC, page 298-308. IEEE Computer Society, (2014)Unsatisfiable CNF Formulas contain Many Conflicts.. ISAAC, volume 8283 of Lecture Notes in Computer Science, page 273-283. Springer, (2013)Trivial, Tractable, Hard. A Not So Sudden Complexity Jump in Neighborhood Restricted CNF Formulas.. ISAAC, volume 8283 of Lecture Notes in Computer Science, page 251-261. Springer, (2013)How Many Conflicts Does It Need to Be Unsatisfiable?, and . SAT, volume 4996 of Lecture Notes in Computer Science, page 246-256. Springer, (2008)Recent studies of agent incentives in internet resource allocation and pricing., , and . Ann. Oper. Res., 314 (1): 49-76 (2022)Derandomization of \(k\) -SAT Algorithm.. Encyclopedia of Algorithms, (2016)