Edward A. Hirsch 个人学术档案

引用次数

	总计	2019 年至今
引用	1836	273
h 指数	21	9
i10 指数	29	8

140

105

19981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202413 11 44 33 48 116 128 116 118 94 90 108 80 82 70 85 56 53 52 43 73 31 56 60 45 60 21

开放获取的出版物数量

查看全部

2 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Evgeny DantsinProfessor of Computer Science, Roosevelt University在 roosevelt.edu 的电子邮件经过验证
Dmitry ItsyksonSteklov Institute of Mathematics at St. Petersburg在 pdmi.ras.ru 的电子邮件经过验证
Dima GrigorievDirecteur de recherche, CNRS, Lille在 math.univ-lille1.fr 的电子邮件经过验证
Arist KojevnikovSenior Development Engineer, OneSpin Solutions GmbH在 logic.pdmi.ras.ru 的电子邮件经过验证
Uwe SchöningProfessor of Computer Science, Ulm University, retired在 uni-ulm.de 的电子邮件经过验证
Jon KleinbergProfessor of Computer Science, Cornell University在 cs.cornell.edu 的电子邮件经过验证
Christos H PAPADIMITRIOUColumbia University在 columbia.edu 的电子邮件经过验证
Prabhakar RaghavanGoogle在 google.com 的电子邮件经过验证
Alexander S. KulikovSteklov Institute of Mathematics at St. Petersburg在 logic.pdmi.ras.ru 的电子邮件经过验证
Dmitrii (Dima) PasechnikComputer Science, Oxford在 cs.ox.ac.uk 的电子邮件经过验证
Sergey NikolenkoSteklov Institute of Mathematics at St. Petersburg, Russia在 logic.pdmi.ras.ru 的电子邮件经过验证
Alexander SmalSt. Petersburg Department of Steklov Mathematical Institute of Russian Academy of Sciences; Technion在 pdmi.ras.ru 的电子邮件经过验证
Laurent SimonProfessor of Computer Science, Bordeaux University, France (since 2013)在 labri.fr 的电子邮件经过验证
Daniel Le BerreCRIL-CNRS Université d'Artois在 cril.fr 的电子邮件经过验证
Alexander WolpertProfessor of Computer Science, Roosevelt University在 roosevelt.edu 的电子邮件经过验证
Peter RossmanithProfessor of Computer Science, RWTH Aachen University在 cs.rwth-aachen.de 的电子邮件经过验证
Rolf NiedermeierTU Berlin在 tu-berlin.de 的电子邮件经过验证
Boris KonevProfessor of Computer Science, Liverpool University在 liverpool.ac.uk 的电子邮件经过验证
Alexander GolovnevGeorgetown University在 cims.nyu.edu 的电子邮件经过验证
Sergei IvanovResearcher, St. Petersburg Department of Steklov Mathematical Institute在 pdmi.ras.ru 的电子邮件经过验证

关注

Edward A. Hirsch

Professor of Computer Science at Ariel University

在 ariel.ac.il 的电子邮件经过验证 - 首页

Proof Complexity SAT Algorithms Computational Complexity


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
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	273	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	169	2005
New worst-case upper bounds for SAT EA Hirsch Journal of Automated Reasoning 24 (4), 397-420, 2000	151	2000
Complexity of Semialgebraic Proofs D Grigoriev, EA Hirsch, D Pasechnik Moscow Mathematical Journal 2 (4), 647-679, 2002	135*	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	123	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	111	2005
The SAT2002 competition L Simon, D Le Berre, EA Hirsch Annals of Mathematics and Artificial Intelligence 43 (1), 307-342, 2005	89	2005
Worst-case upper bounds E Dantsin, EA Hirsch Handbook of Satisfiability, 669-692, 2021	75*	2021
Two New Upper Bounds for SAT. EA Hirsch SODA, 521-530, 1998	58	1998
SAT local search algorithms: worst-case study EA Hirsch Journal of Automated Reasoning 24 (1), 127-143, 2000	55	2000
A 2 K/4-time algorithm for MAX-2-SAT: Corrected version EA Hirsch	53*	1999
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	51*	2003
Deterministic algorithms for k-SAT based on covering codes and local search ∗ E Dantsin, A Goerdt, EA Hirsch, U Schöning ICALP-2000, 2000	51	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	50*	2000
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	48*	2001
Algebraic proof systems over formulas D Grigoriev, EA Hirsch Theoretical Computer Science 303 (1), 83-102, 2003	44	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	38	2004
Worst-case study of local search for MAX-k-SAT EA Hirsch Discrete Applied Mathematics 130 (2), 173-184, 2003	35*	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	32*	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

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用