Travelled to:1 × Finland
1 × Spain
1 × Switzerland
1 × USA
1 × United Kingdom
Collaborated with:E.Dantsin S.I.Nikolenko M.Alekhnovich D.Itsykson D.Grigoriev D.V.Pasechnik A.Goerdt U.Schöning
Talks about:exponenti (2) algorithm (2) satisfi (2) proof (2) lower (2) bound (2) time (2) subexponenti (1) determinist (1) restrict (1)
Person: Edward A. Hirsch
DBLP: Hirsch:Edward_A=
Contributed to:
20112005
200420022000Wrote 5 papers:
- SAT-2011-DantsinH #satisfiability
- Satisfiability Certificates Verifiable in Subexponential Time (ED, EAH), pp. 19–32.
- SAT-2005-HirschN #proving #simulation #strict
- Simulating Cutting Plane Proofs with Restricted Degree of Falsity by Resolution (EAH, SIN), pp. 135–142.
- ICALP-2004-AlekhnovichHI #algorithm #bound #exponential #satisfiability
- Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas (MA, EAH, DI), pp. 84–96.
- ICALP-2002-GrigorievHP #algebra #bound #exponential #proving
- Exponential Lower Bound for Static Semi-algebraic Proofs (DG, EAH, DVP), pp. 257–268.
- ICALP-2000-DantsinGHS #algorithm #satisfiability
- Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search (ED, AG, EAH, US), pp. 236–247.