( en | de | ru )

 

Disambiguation of "Hirsch, Edward A."

Author of the publication

copydeleteadd this publication to your clipboard
A deterministic (2-2/(k+1))n algorithm for k-SAT based on local search.

, , , , , , , and . Theor. Comput. Sci., 289 (1): 69-83 (2002)

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.

Edward Hartstein

Edward Dotzel

Edward Birkenbeil

Edward Fischer

Edward Sobel

 

Other publications of authors with the same name

Preface., , and . Theory Comput. Syst., 61 (2): 261-262 (2017)Preface., and . Theory Comput. Syst., 56 (4): 591-592 (2015)Exponential Lower Bound for Static Semi-algebraic Proofs., , and . ICALP, volume 2380 of Lecture Notes in Computer Science, page 257-268. Springer, (2002)Semi-Algebraic Proofs, IPS Lower Bounds and the τ-Conjecture: Can a Natural Number be Negative?, , , and . CoRR, (2019)On Optimal Heuristic Randomized Semidecision Procedures, with Application to Proof Complexity., and . STACS, volume 5 of LIPIcs, page 453-464. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)Several notes on the power of Gomory-Chvátal cuts., and . Ann. Pure Appl. Log., 141 (3): 429-436 (2006)UnitWalk: A new SAT solver that uses local search guided by unit clause elimination., and . Ann. Math. Artif. Intell., 43 (1): 91-111 (2005)The SAT2002 competition., , and . Ann. Math. Artif. Intell., 43 (1): 307-342 (2005)New Worst-Case Upper Bounds for SAT.. J. Autom. Reason., 24 (4): 397-420 (2000)Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas., , and . J. Autom. Reason., 35 (1-3): 51-72 (2005)