• 619 Citations
  • 15 h-Index
19972018

Research output per year

If you made any changes in Pure these will be visible here soon.

Research Output

  • 619 Citations
  • 15 h-Index
  • 20 статья
  • 14 статья в сборнике материалов конференции
  • 4 статья в журнале по материалам конференции
  • 1 глава/раздел
Filter
статья
2018

On the limits of gate elimination

Golovnev, A., Hirsch, E. A., Knop, A. & Kulikov, A. S., 1 Sep 2018, In : Journal of Computer and System Sciences. 96, p. 107-119 13 p.

Research output

2015

On the probabilistic closure of the loose unambiguous hierarchy

Hirsch, E. A. & Sokolov, D., 1 Sep 2015, In : Information Processing Letters. 115, 9, p. 725-730 6 p.

Research output

2013
1 Citation (Scopus)
2012
3 Citations (Scopus)
2010
Open Access
1 Citation (Scopus)
2009

A complete public-key cryptosystem

Grigoriev, D., Hirsch, E. A. & Pervyshev, K., 1 Apr 2009, In : Groups, Complexity, Cryptology. 1, 1, p. 1-12 12 p.

Research output

11 Citations (Scopus)

Time hierarchies for cryptographic function inversion with advice

Grigoriev, D. Y., Hirsch, E. A. & Pervyshev, K. V., 1 May 2009, In : Journal of Mathematical Sciences . 158, 5, p. 633-644 12 p.

Research output

2006

Several notes on the power of Gomory-Chvátal cuts

Hirsch, E. A. & Kojevnikov, A., 1 Sep 2006, In : Annals of Pure and Applied Logic. 141, 3, p. 429-436 8 p.

Research output

Open Access
2 Citations (Scopus)
2005

Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas

Alekhnovich, M., Hirsch, E. A. & Itsykson, D., 1 Oct 2005, In : Journal of Automated Reasoning. 35, 1-3, p. 51-72 22 p.

Research output

41 Citations (Scopus)

The SAT2002 competition

Simon, L., Le Berre, D. & Hirsch, E. A., Jan 2005, In : Annals of Mathematics and Artificial Intelligence. 43, 1-4, p. 307-342 36 p.

Research output

22 Citations (Scopus)
44 Citations (Scopus)
2004
16 Citations (Scopus)
2002

A deterministic (2 - 2/(k + 1))n algorithm for k-SAT based on local search

Dantsin, E., Goerdt, A., Hirsch, E. A., Kannan, R., Kleinberg, J., Papadimitriou, C., Raghavan, P. & Schöning, U., 23 Oct 2002, In : Theoretical Computer Science. 289, 1, p. 69-83 15 p.

Research output

Open Access
119 Citations (Scopus)
2001

MAX SAT approximation beyond the limits of polynomial-time approximation

Dantsin, E., Gavrilovich, M., Hirsch, E. A. & Konev, B., 27 Dec 2001, In : Annals of Pure and Applied Logic. 113, 1-3, p. 81-94 14 p.

Research output

Open Access
20 Citations (Scopus)
2000

New worst-case upper bounds for SAT

Hirsch, E. A., 1 Jan 2000, In : Journal of Automated Reasoning. 24, 4, p. 397-420 24 p.

Research output

60 Citations (Scopus)

SAT local search algorithms: worst-case study

Hirsch, E. A., 1 Feb 2000, In : Journal of Automated Reasoning. 24, 1-2, p. 127-143 17 p.

Research output

17 Citations (Scopus)
1997