Edward A. Hirsch
Affiliations:- Ariel University, Israel
- Technion, Haifa, Israel (former)
- Steklov Institute of Mathematics, St. Petersburg, Russia (former, PhD 1998)
According to our database1,
Edward A. Hirsch
authored at least 57 papers
between 1998 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2000
2005
2010
2015
2020
0
1
2
3
4
5
6
7
1
1
1
1
2
3
2
1
1
1
4
1
1
1
1
2
1
5
1
5
1
3
4
1
1
1
1
2
1
1
1
2
2
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
On csauthors.net:
Bibliography
2024
Semialgebraic Proofs, IPS Lower Bounds, and the \(\boldsymbol{\tau}\)-Conjecture: Can a Natural Number be Negative?
SIAM J. Comput., 2024
2023
Electron. Colloquium Comput. Complex., 2023
2022
2021
Proceedings of the Handbook of Satisfiability - Second Edition, 2021
2020
Semi-algebraic proofs, IPS lower bounds, and the τ-conjecture: can a natural number be negative?
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020
2019
Semi-Algebraic Proofs, IPS Lower Bounds and the $\tau$-Conjecture: Can a Natural Number be Negative?
Electron. Colloquium Comput. Complex., 2019
2018
2017
2016
2015
Inf. Process. Lett., 2015
Electron. Colloquium Comput. Complex., 2015
Bull. EATCS, 2015
2014
2012
Inf. Process. Lett., 2012
2011
Electron. Colloquium Comput. Complex., 2011
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011
2010
On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography.
Electron. Colloquium Comput. Complex., 2010
Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010
On Optimal Heuristic Randomized Semidecision Procedures, with Application to Proof Complexity.
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010
2009
J. Satisf. Boolean Model. Comput., 2009
2008
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
2007
Electron. Colloquium Comput. Complex., 2007
2005
Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms
Electron. Colloquium Comput. Complex., 2005
Electron. Colloquium Comput. Complex., 2005
Electron. Colloquium Comput. Complex., 2005
Ann. Math. Artif. Intell., 2005
2004
Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas
Electron. Colloquium Comput. Complex., 2004
2003
Electron. Colloquium Comput. Complex., 2003
Electron. Colloquium Comput. Complex., 2003
Discret. Appl. Math., 2003
2002
Theor. Comput. Sci., 2002
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002
2001
Electron. Colloquium Comput. Complex., 2001
Ann. Pure Appl. Log., 2001
Proceedings of the Principles and Practice of Constraint Programming, 2001
2000
Electron. Colloquium Comput. Complex., 2000
Worst-case time bounds for MAX-k-SAT w.r.t. the number of variables using local search
Electron. Colloquium Comput. Complex., 2000
Worst-case Time Bounds for MAX-k-SAT with respect to the Number of Variables Using Local Search.
Proceedings of the ICALP Workshops 2000, 2000
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000
1999
1998
Log. J. IGPL, 1998
Proceedings of the Algorithm Theory, 1998
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998