Edward A. Hirsch
Edward A. Hirsch
Research Lead, Steklov Institute of Mathematics at St.Petersburg
Verified email at pdmi.ras.ru - Homepage
Cited by
Cited by
A deterministic (2-2/(k+1))^n algorithm for k-SAT based on local search
E Dantsin, A Goerdt, EA Hirsch, R Kannan, J Kleinberg, C Papadimitriou, ...
Theoretical Computer Science 289 (1), 69-83, 2002
UnitWalk: A new SAT solver that uses local search guided by unit clause elimination
EA Hirsch, A Kojevnikov
Annals of Mathematics and Artificial Intelligence 43 (1), 91-111, 2005
New worst-case upper bounds for SAT
EA Hirsch
Journal of Automated Reasoning 24 (4), 397-420, 2000
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT
J Gramm, EA Hirsch, R Niedermeier, P Rossmanith
Discrete Applied Mathematics 130 (2), 139-155, 2003
Complexity of Semialgebraic Proofs
D Grigoriev, EA Hirsch, D Pasechnik
Moscow Mathematical Journal 2 (4), 647-679, 2002
Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas
M Alekhnovich, EA Hirsch, D Itsykson
Journal of Automated Reasoning 35 (1), 51-72, 2005
The SAT2002 competition
L Simon, D Le Berre, EA Hirsch
Annals of Mathematics and Artificial Intelligence 43 (1), 307-342, 2005
Worst-Case Upper Bounds.
E Dantsin, EA Hirsch
Handbook of Satisfiability 185 (403-424), 9, 2009
Two New Upper Bounds for SAT.
EA Hirsch
SODA, 521-530, 1998
SAT local search algorithms: worst-case study
EA Hirsch
Journal of Automated Reasoning 24 (1), 127-143, 2000
A 2 K/4-time algorithm for MAX-2-SAT: Corrected version
EA Hirsch
Deterministic algorithms for k-SAT based on covering codes and local search ∗
E Dantsin, A Goerdt, EA Hirsch, U Schöning
ICALP-2000, 2000
Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search
EA Hirsch, E Dantsin, A Goerdt, U Schoning
ICALP-2000, 236, 2000
Algorithms for SAT and upper bounds on their complexity
MA Vsemirnov, EA Hirsch, EY Dantsin, SV Ivanov
Journal of Mathematical Sciences 118 (2), 4948-4962, 2003
Worst-case study of local search for MAX-k-SAT
EA Hirsch
Discrete Applied Mathematics 130 (2), 173-184, 2003
Algorithms for SAT based on search in Hamming balls
E Dantsin, EA Hirsch, A Wolpert
Annual Symposium on Theoretical Aspects of Computer Science, 141-151, 2004
On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography
EA Hirsch, D Itsykson, I Monakhov, A Smal
Theory of Computing Systems 51 (2), 179-195, 2012
MAX SAT approximation beyond the limits of polynomial-time approximation
E Dantsin, M Gavrilovich, EA Hirsch, B Konev
Annals of Pure and Applied Logic 113 (1-3), 81-94, 2001
A complete public-key cryptosystem
D Grigoriev, EA Hirsch, K Pervyshev
Walter de Gruyter GmbH & Co. KG 1 (1), 1-12, 2009
A fast deterministic algorithm for formulas that have many satisfying assignments
EA Hirsch
Logic Journal of IGPL 6 (1), 59-71, 1998
The system can't perform the operation now. Try again later.
Articles 1–20