Edward A. Hirsch

Citée par

	Toutes	Depuis 2018
Citations	1794	296
indice h	22	10
indice i10	28	10

140

105

1998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202313 10 43 32 49 120 124 114 119 96 96 100 79 87 84 86 53 49 53 46 76 27 50 60 42 41

Accès public

Tout afficher

2 articles

0 article

disponibles

non disponibles

Sur la base des exigences liées au financement

Coauteurs

Evgeny DantsinProfessor of Computer Science, Roosevelt UniversityAdresse e-mail validée de roosevelt.edu
Dmitry ItsyksonSteklov Institute of Mathematics at St. PetersburgAdresse e-mail validée de pdmi.ras.ru
Dima GrigorievDirecteur de recherche, CNRS, LilleAdresse e-mail validée de math.univ-lille1.fr
Arist KojevnikovSenior Development Engineer, OneSpin Solutions GmbHAdresse e-mail validée de logic.pdmi.ras.ru
Uwe SchöningProfessor of Computer Science, Ulm University, retiredAdresse e-mail validée de uni-ulm.de
Jon KleinbergProfessor of Computer Science, Cornell UniversityAdresse e-mail validée de cs.cornell.edu
Christos H PAPADIMITRIOUColumbia UniversityAdresse e-mail validée de columbia.edu
Prabhakar RaghavanGoogleAdresse e-mail validée de google.com
Dmitrii (Dima) PasechnikComputer Science, OxfordAdresse e-mail validée de cs.ox.ac.uk
Sergey NikolenkoSteklov Institute of Mathematics at St. Petersburg, RussiaAdresse e-mail validée de logic.pdmi.ras.ru
Alexander S. KulikovSteklov Institute of Mathematics at St. PetersburgAdresse e-mail validée de logic.pdmi.ras.ru
Alexander SmalSt. Petersburg Department of Steklov Mathematical Institute of Russian Academy of Sciences; TechnionAdresse e-mail validée de pdmi.ras.ru
Laurent SimonProfessor of Computer Science, Bordeaux University, France (since 2013)Adresse e-mail validée de labri.fr
Daniel Le BerreCRIL-CNRS Université d'ArtoisAdresse e-mail validée de cril.fr
Peter RossmanithProfessor of Computer Science, RWTH Aachen UniversityAdresse e-mail validée de cs.rwth-aachen.de
Rolf NiedermeierTU BerlinAdresse e-mail validée de tu-berlin.de
Alexander WolpertProfessor of Computer Science, Roosevelt UniversityAdresse e-mail validée de roosevelt.edu
Boris KonevProfessor of Computer Science, Liverpool UniversityAdresse e-mail validée de liverpool.ac.uk
Sergei IvanovResearcher, St. Petersburg Department of Steklov Mathematical InstituteAdresse e-mail validée de pdmi.ras.ru
Alexander GolovnevGeorgetown UniversityAdresse e-mail validée de cims.nyu.edu

Suivre

Edward A. Hirsch

Ariel University

Adresse e-mail validée de ariel.ac.il - Page d'accueil

Proof Complexity SAT Algorithms Computational Complexity


Titre Trier par citations Trier par année Trier par titre	Citée par Citée par	Année
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	269	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, 91-111, 2005	170	2005
New worst-case upper bounds for SAT EA Hirsch Journal of Automated Reasoning 24 (4), 397-420, 2000	149	2000
Complexity of Semialgebraic Proofs D Grigoriev, EA Hirsch, D Pasechnik Moscow Mathematical Journal 2 (4), 647-679, 2002	133*	2002
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	126	2003
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	104	2005
The SAT2002 competition L Simon, D Le Berre, EA Hirsch Annals of Mathematics and Artificial Intelligence 43 (1), 307-342, 2005	86	2005
Worst-case upper bounds E Dantsin, EA Hirsch Handbook of Satisfiability, 669-692, 2021	72*	2021
Two New Upper Bounds for SAT. EA Hirsch SODA, 521-530, 1998	57	1998
SAT local search algorithms: worst-case study EA Hirsch Journal of Automated Reasoning 24 (1), 127-143, 2000	54	2000
A 2 K/4-time algorithm for MAX-2-SAT: Corrected version EA Hirsch	53*	1999
Deterministic algorithms for k-SAT based on covering codes and local search ∗ E Dantsin, A Goerdt, EA Hirsch, U Schöning ICALP-2000, 2000	52	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	50*	2003
Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search EA Hirsch, E Dantsin, A Goerdt, U Schoning ICALP-2000, 236, 2000	50*	2000
Algebraic proof systems over formulas D Grigoriev, EA Hirsch Theoretical Computer Science 303 (1), 83-102, 2003	42	2003
Algorithms for SAT Based on Search in Hamming Balls E Dantsin, EA Hirsch, A Wolpert STACS 2004: 21st Annual Symposium on Theoretical Aspects of Computer Science …, 2004	35	2004
Worst-case study of local search for MAX-k-SAT EA Hirsch Discrete Applied Mathematics 130 (2), 173-184, 2003	33*	2003
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	30*	2012
A complete public-key cryptosystem D Grigoriev, EA Hirsch, K Pervyshev Walter de Gruyter GmbH & Co. KG 1 (1), 1-12, 2009	28	2009
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	27	2001

Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.

Articles 1–20

Nombre de citations par an

Citations en double

Citations fusionnées

Ajouter les coauteursCoauteurs

Suivre

Citée par

Coauteurs