Edward A. Hirsch

Available identifiers

zbMath Open hirsch.edward-aWikidataQ16636873 ScholiaQ16636873MaRDI QIDQ234710

List of research outcomes

Publication	Date of Publication	Type
Irreducible subcube partitions	2024-02-23	Paper
Gregory Samuilovich Tseytin (obituary)	2024-01-25	Paper
Improving \(3N\) circuit complexity lower bounds	2024-01-24	Paper
The power of the binary value principle	2023-10-04	Paper
Proving Unsatisfiability with Hitting Formulas	2023-02-13	Paper
Local search algorithms for SAT: Worst-case analysis	2022-12-09	Paper
Semi-algebraic proofs, IPS lower bounds, and the τ-conjecture: can a natural number be negative?	2021-01-19	Paper
On the limits of gate elimination	2018-06-06	Paper
https://portal.mardi4nfdi.de/entity/Q4608608	2018-03-21	Paper
On the probabilistic closure of the loose unambiguous hierarchy	2015-06-02	Paper
Nikolai Aleksandrovich Shanin (obituary)	2013-12-17	Paper
Optimal heuristic algorithms for the image of an injective function	2013-04-09	Paper
Feebly secure cryptographic primitives	2013-04-09	Paper
On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography	2012-12-07	Paper
On an optimal randomized acceptor for graph nonisomorphism	2012-05-04	Paper
https://portal.mardi4nfdi.de/entity/Q3113771	2012-01-23	Paper
Satisfiability Certificates Verifiable in Subexponential Time	2011-06-17	Paper
An infinitely-often one-way function based on an average-case assumption	2010-09-01	Paper
Optimal Acceptors and Optimal Proof Systems	2010-06-17	Paper
Time hierarchies for cryptographic function inversion with advice	2010-01-15	Paper
https://portal.mardi4nfdi.de/entity/Q3181643	2009-10-12	Paper
A Feebly Secure Trapdoor Function	2009-08-18	Paper
A Complete Public-Key Cryptosystem	2009-03-23	Paper
An Infinitely-Often One-Way Function Based on an Average-Case Assumption	2008-07-10	Paper
STACS 2004	2007-10-01	Paper
Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms	2007-05-02	Paper
Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas	2007-01-24	Paper
Several notes on the power of Gomory-Chvátal cuts	2006-08-16	Paper
Theory and Applications of Satisfiability Testing	2005-12-15	Paper
Automata, Languages and Programming	2005-08-24	Paper
Algorithms for Sat and upper bounds on their complexity	2005-08-05	Paper
UnitWalk: A new SAT solver that uses local search guided by unit clause elimination	2005-05-13	Paper
https://portal.mardi4nfdi.de/entity/Q4736859	2004-08-11	Paper
https://portal.mardi4nfdi.de/entity/Q4737162	2004-08-11	Paper
https://portal.mardi4nfdi.de/entity/Q4475671	2004-08-09	Paper
https://portal.mardi4nfdi.de/entity/Q4807964	2004-01-14	Paper
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT.	2003-09-15	Paper
Worst-case study of local search for MAX-\(k\)-SAT.	2003-09-15	Paper
Algebraic proof systems over formulas.	2003-08-17	Paper
A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search.	2003-01-21	Paper
MAX SAT approximation beyond the limits of polynomial-time approximation	2002-03-13	Paper
https://portal.mardi4nfdi.de/entity/Q2754147	2001-11-11	Paper
https://portal.mardi4nfdi.de/entity/Q2749857	2001-10-21	Paper
https://portal.mardi4nfdi.de/entity/Q2749858	2001-10-21	Paper
SAT local search algorithms: Worst-case study	2001-09-03	Paper
New worst-case upper bounds for SAT	2001-05-14	Paper
https://portal.mardi4nfdi.de/entity/Q4501522	2001-05-06	Paper
https://portal.mardi4nfdi.de/entity/Q4250220	2000-05-18	Paper
On construction of a symbolic realization of hyperbolic automorphisms of the torus	1998-06-08	Paper
A fast deterministic algorithm for formulas that have many satisfying assignments	1998-03-17	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Edward A. Hirsch