default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEdward A. Hirsch
Person information
- affiliation: Ariel University, Israel
- affiliation (former): Technion, Haifa, Israel
- affiliation (former, PhD 1998): Steklov Institute of Mathematics, St. Petersburg, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j25]Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret
:
Semialgebraic Proofs, IPS Lower Bounds, and the \(\boldsymbol{\tau}\)-Conjecture: Can a Natural Number be Negative? SIAM J. Comput. 53(3): 648-700 (2024)- [c22]Yuval Filmus, Edward A. Hirsch, Artur Riazanov, Alexander Smal, Marc Vinyals:
Proving Unsatisfiability with Hitting Formulas. ITCS 2024: 48:1-48:20 - [i28]Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch:
Tropical proof systems. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [j24]Magnus Gausdal Find, Alexander Golovnev, Edward A. Hirsch, Alexander S. Kulikov:
Improving 3N Circuit Complexity Lower Bounds. Comput. Complex. 32(2): 13 (2023) - [j23]Yuval Filmus, Edward A. Hirsch, Sascha Kurz, Ferdinand Ihringer, Artur Ryazanov, Alexander V. Smal, Marc Vinyals:
Irreducible Subcube Partitions. Electron. J. Comb. 30(3) (2023) - [c21]Yaroslav Alekseev, Edward A. Hirsch:
The Power of the Binary Value Principle. CIAC 2023: 21-36 - [i27]Yuval Filmus, Edward A. Hirsch, Artur Riazanov, Alexander Smal, Marc Vinyals:
Proving Unsatisfiability with Hitting Formulas. CoRR abs/2302.06241 (2023) - [i26]Yuval Filmus, Edward A. Hirsch, Artur Riazanov, Alexander Smal, Marc Vinyals:
Proving Unsatisfiability with Hitting Formulas. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j22]Yuval Filmus, Edward A. Hirsch, Sascha Kurz, Ferdinand Ihringer, Artur Riazanov, Alexander Smal, Marc Vinyals:
Irreducible subcube partitions. CoRR abs/2212.14685: 1-38 (2022) - [i25]Yaroslav Alekseev, Edward A. Hirsch:
The power of the Binary Value Principle. CoRR abs/2210.17429 (2022) - [i24]Yaroslav Alekseev, Edward A. Hirsch:
The power of the Binary Value Principle. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [p2]Evgeny Dantsin, Edward A. Hirsch:
Worst-Case Upper Bounds. Handbook of Satisfiability 2021: 669-692 - 2020
- [c20]Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret:
Semi-algebraic proofs, IPS lower bounds, and the τ-conjecture: can a natural number be negative? STOC 2020: 54-67
2010 – 2019
- 2019
- [i23]Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret:
Semi-Algebraic Proofs, IPS Lower Bounds and the τ-Conjecture: Can a Natural Number be Negative? CoRR abs/1911.06738 (2019) - [i22]Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret:
Semi-Algebraic Proofs, IPS Lower Bounds and the $\tau$-Conjecture: Can a Natural Number be Negative? Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j21]Alexander Golovnev, Edward A. Hirsch, Alexander Knop, Alexander S. Kulikov:
On the limits of gate elimination. J. Comput. Syst. Sci. 96: 107-119 (2018) - 2017
- [j20]Andrei A. Bulatov, Edward A. Hirsch, Jean-Éric Pin:
Preface. Theory Comput. Syst. 61(2): 261-262 (2017) - 2016
- [c19]Magnus Gausdal Find, Alexander Golovnev, Edward A. Hirsch, Alexander S. Kulikov:
A Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit Function. FOCS 2016: 89-98 - [c18]Alexander Golovnev, Edward A. Hirsch, Alexander Knop, Alexander S. Kulikov:
On the Limits of Gate Elimination. MFCS 2016: 46:1-46:13 - [r2]Edward A. Hirsch:
Exact Algorithms for General CNF SAT. Encyclopedia of Algorithms 2016: 670-674 - [i21]Alexander Golovnev, Edward A. Hirsch, Alexander Knop, Alexander S. Kulikov:
On the Limits of Gate Elimination. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j19]Edward A. Hirsch:
Russian Chapter of European Association for Theoretical Computer Science. Bull. EATCS 115 (2015) - [j18]Edward A. Hirsch, Dmitry Sokolov:
On the probabilistic closure of the loose unambiguous hierarchy. Inf. Process. Lett. 115(9): 725-730 (2015) - [j17]Juhani Karhumäki, Edward A. Hirsch:
Preface. Theory Comput. Syst. 56(4): 591-592 (2015) - [i20]Magnus Gausdal Find, Alexander Golovnev, Edward A. Hirsch, Alexander S. Kulikov:
A better-than-3n lower bound for the circuit complexity of an explicit function. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [e4]Edward A. Hirsch, Sergei O. Kuznetsov, Jean-Éric Pin, Nikolay K. Vereshchagin:
Computer Science - Theory and Applications - 9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014. Proceedings. Lecture Notes in Computer Science 8476, Springer 2014, ISBN 978-3-319-06685-1 [contents] - [i19]Olaf Beyersdorff, Edward A. Hirsch, Jan Krajícek, Rahul Santhanam:
Optimal algorithms and proofs (Dagstuhl Seminar 14421). Dagstuhl Reports 4(10): 51-68 (2014) - [i18]Edward A. Hirsch, Dmitry Sokolov:
On the probabilistic closure of the loose unambiguous hierarchy. Electron. Colloquium Comput. Complex. TR14 (2014) - 2012
- [j16]Edward A. Hirsch, Dmitry Itsykson:
On an optimal randomized acceptor for graph nonisomorphism. Inf. Process. Lett. 112(5): 166-171 (2012) - [j15]Edward A. Hirsch, Dmitry Itsykson, Ivan Monakhov, Alexander Smal:
On Optimal Heuristic Randomized Semidecision Procedures, with Applications to Proof Complexity and Cryptography. Theory Comput. Syst. 51(2): 179-195 (2012) - [e3]Edward A. Hirsch, Juhani Karhumäki, Arto Lepistö, Michail Kh. Prilutskii:
Computer Science - Theory and Applications - 7th International Computer Science Symposium in Russia, CSR 2012, Nizhny Novgorod, Russia, July 3-7, 2012. Proceedings. Lecture Notes in Computer Science 7353, Springer 2012, ISBN 978-3-642-30641-9 [contents] - 2011
- [c17]Evgeny Dantsin, Edward A. Hirsch:
Satisfiability Certificates Verifiable in Subexponential Time. SAT 2011: 19-32 - [i17]Edward A. Hirsch, Dmitry Itsykson, Valeria Nikolaenko, Alexander Smal:
Optimal heuristic algorithms for the image of an injective function. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [c16]Edward A. Hirsch, Dmitry Itsykson:
On Optimal Heuristic Randomized Semidecision Procedures, with Application to Proof Complexity. STACS 2010: 453-464 - [c15]Edward A. Hirsch:
Optimal Acceptors and Optimal Proof Systems. TAMC 2010: 28-39 - [i16]Edward A. Hirsch, Dmitry Itsykson, Ivan Monakhov, Alexander Smal:
On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j14]Dima Grigoriev, Edward A. Hirsch, Konstantin Pervyshev:
A Complete Public-Key Cryptosystem. Groups Complex. Cryptol. 1(1): 1-12 (2009) - [j13]Edward A. Hirsch, Arist Kojevnikov, Alexander S. Kulikov, Sergey I. Nikolenko:
Complexity of Semialgebraic Proofs with Restricted Degree of Falsity. J. Satisf. Boolean Model. Comput. 6(1-3): 53-69 (2009) - [c14]Edward A. Hirsch, Sergey I. Nikolenko:
A Feebly Secure Trapdoor Function. CSR 2009: 129-142 - [p1]Evgeny Dantsin, Edward A. Hirsch:
Worst-Case Upper Bounds. Handbook of Satisfiability 2009: 403-424 - [i15]Edward A. Hirsch, Dmitry Itsykson:
On optimal heuristic randomized semidecision procedures, with application to proof complexity. CoRR abs/0908.2707 (2009) - 2008
- [c13]Edward A. Hirsch, Dmitry Itsykson:
An Infinitely-Often One-Way Function Based on an Average-Case Assumption. WoLLIC 2008: 208-217 - [e2]Edward A. Hirsch, Alexander A. Razborov, Alexei L. Semenov, Anatol Slissenko:
Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, Moscow, Russia, June 7-12, 2008, Proceedings. Lecture Notes in Computer Science 5010, Springer 2008, ISBN 978-3-540-79708-1 [contents] - [r1]Edward A. Hirsch:
Exact Algorithms for General CNF SAT. Encyclopedia of Algorithms 2008 - 2007
- [i14]Edward A. Hirsch, Dmitry Itsykson:
An infinitely-often one-way function based on an average-case assumption. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j12]Edward A. Hirsch, Arist Kojevnikov:
Several notes on the power of Gomory-Chvátal cuts. Ann. Pure Appl. Log. 141(3): 429-436 (2006) - [c12]Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert:
Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms. CIAC 2006: 60-68 - [e1]Dima Grigoriev, John Harrison, Edward A. Hirsch:
Computer Science - Theory and Applications, First International Symposium on Computer Science in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006, Proceedings. Lecture Notes in Computer Science 3967, Springer 2006, ISBN 3-540-34166-8 [contents] - [i13]Dima Grigoriev, Edward A. Hirsch, Konstantin Pervyshev:
A Complete Public-Key Cryptosystem. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j11]Edward A. Hirsch, Arist Kojevnikov:
UnitWalk: A new SAT solver that uses local search guided by unit clause elimination. Ann. Math. Artif. Intell. 43(1): 91-111 (2005) - [j10]Laurent Simon, Daniel Le Berre, Edward A. Hirsch:
The SAT2002 competition. Ann. Math. Artif. Intell. 43(1): 307-342 (2005) - [j9]Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson:
Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas. J. Autom. Reason. 35(1-3): 51-72 (2005) - [c11]Edward A. Hirsch, Sergey I. Nikolenko:
Simulating Cutting Plane Proofs with Restricted Degree of Falsity by Resolution. SAT 2005: 135-142 - [i12]Edward A. Hirsch, Sergey I. Nikolenko:
Simulating Cutting Plane proofs with restricted degree of falsity by Resolution. Electron. Colloquium Comput. Complex. TR05 (2005) - [i11]Dima Grigoriev, Edward A. Hirsch, Konstantin Pervyshev:
Time hierarchies for cryptographic function inversion with advice. Electron. Colloquium Comput. Complex. TR05 (2005) - [i10]Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert:
Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [c10]Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson:
Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas. ICALP 2004: 84-96 - [c9]Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert:
Algorithms for SAT Based on Search in Hamming Balls. STACS 2004: 141-151 - [i9]Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson:
Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j8]Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith:
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. Discret. Appl. Math. 130(2): 139-155 (2003) - [j7]Edward A. Hirsch:
Worst-case study of local search for MAX-k-SAT. Discret. Appl. Math. 130(2): 173-184 (2003) - [j6]Dima Grigoriev, Edward A. Hirsch:
Algebraic proof systems over formulas. Theor. Comput. Sci. 303(1): 83-102 (2003) - [i8]Edward A. Hirsch, Arist Kojevnikov:
Several notes on the power of Gomory-Chvatal cuts. Electron. Colloquium Comput. Complex. TR03 (2003) - [i7]Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert:
Algorithms for SAT based on search in Hamming balls. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [j5]Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Ravi Kannan, Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan, Uwe Schöning:
A deterministic (2-2/(k+1))n algorithm for k-SAT based on local search. Theor. Comput. Sci. 289(1): 69-83 (2002) - [c8]Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik:
Exponential Lower Bound for Static Semi-algebraic Proofs. ICALP 2002: 257-268 - [c7]Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik:
Complexity of Semi-algebraic Proofs. STACS 2002: 419-430 - 2001
- [j4]Evgeny Dantsin, Michael Gavrilovich, Edward A. Hirsch, Boris Konev:
MAX SAT approximation beyond the limits of polynomial-time approximation. Ann. Pure Appl. Log. 113(1-3): 81-94 (2001) - [c6]Edward A. Hirsch, Arist Kojevnikov:
Solving Boolean Satisfiability Using Local Search Guided by Unit Clause Elimination. CP 2001: 605-609 - [i6]Dima Grigoriev, Edward A. Hirsch:
Algebraic proof systems over formulas. Electron. Colloquium Comput. Complex. TR01 (2001) - [i5]Evgeny Dantsin, Edward A. Hirsch, Sergei Ivanov, Maxim Vsemirnov:
Algorithms for SAT and Upper Bounds on Their Complexity. Electron. Colloquium Comput. Complex. TR01 (2001) - [i4]Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik:
Complexity of semi-algebraic proofs. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [j3]Edward A. Hirsch:
SAT Local Search Algorithms: Worst-Case Study. J. Autom. Reason. 24(1/2): 127-143 (2000) - [j2]Edward A. Hirsch:
New Worst-Case Upper Bounds for SAT. J. Autom. Reason. 24(4): 397-420 (2000) - [c5]Edward A. Hirsch:
Worst-case Time Bounds for MAX-k-SAT with respect to the Number of Variables Using Local Search. ICALP Satellite Workshops 2000: 69-76 - [c4]Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Uwe Schöning:
Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search. ICALP 2000: 236-247 - [c3]Edward A. Hirsch:
A New Algorithm for MAX-2-SAT. STACS 2000: 65-73 - [i3]Edward A. Hirsch:
Worst-case time bounds for MAX-k-SAT w.r.t. the number of variables using local search. Electron. Colloquium Comput. Complex. TR00 (2000) - [i2]Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith:
New Worst-Case Upper Bounds for MAX-2-SAT with Application to MAX-CUT. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [i1]Edward A. Hirsch:
A New Algorithm for MAX-2-SAT. Electron. Colloquium Comput. Complex. TR99 (1999) - 1998
- [j1]Edward A. Hirsch:
A Fast Deterministic Algorithm for Formulas That Have Many Satisfying Assignments. Log. J. IGPL 6(1): 59-71 (1998) - [c2]Edward A. Hirsch:
Two New Upper Bounds for SAT. SODA 1998: 521-530 - [c1]Edward A. Hirsch:
Local Search Algorithms for SAT: Worst-Case Analysis. SWAT 1998: 246-254
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
