The following pages link to Edward A. Hirsch (Q234710):
Displayed 50 items.
- On an optimal randomized acceptor for graph nonisomorphism (Q413276) (← links)
- On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography (Q693058) (← links)
- (Q843599) (redirect page) (← links)
- Time hierarchies for cryptographic function inversion with advice (Q843601) (← links)
- Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas (Q862399) (← links)
- On construction of a symbolic realization of hyperbolic automorphisms of the torus (Q1375172) (← links)
- Algebraic proof systems over formulas. (Q1401356) (← links)
- Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. (Q1408377) (← links)
- Worst-case study of local search for MAX-\(k\)-SAT. (Q1408379) (← links)
- New worst-case upper bounds for SAT (Q1581847) (← links)
- On the limits of gate elimination (Q1635510) (← links)
- UnitWalk: A new SAT solver that uses local search guided by unit clause elimination (Q1777395) (← links)
- A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search. (Q1853552) (← links)
- Optimal heuristic algorithms for the image of an injective function (Q1946839) (← links)
- Feebly secure cryptographic primitives (Q1946841) (← links)
- SAT local search algorithms: Worst-case study (Q1977754) (← links)
- On the probabilistic closure of the loose unambiguous hierarchy (Q2346573) (← links)
- Algorithms for Sat and upper bounds on their complexity (Q2487388) (← links)
- Several notes on the power of Gomory-Chvátal cuts (Q2498920) (← links)
- (Q2749857) (← links)
- (Q2749858) (← links)
- (Q2754147) (← links)
- Nikolai Aleksandrovich Shanin (obituary) (Q2868459) (← links)
- Satisfiability Certificates Verifiable in Subexponential Time (Q3007671) (← links)
- (Q3113771) (← links)
- (Q3181643) (← links)
- A Feebly Secure Trapdoor Function (Q3392948) (← links)
- Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms (Q3434543) (← links)
- An Infinitely-Often One-Way Function Based on an Average-Case Assumption (Q3511459) (← links)
- Optimal Acceptors and Optimal Proof Systems (Q3569061) (← links)
- An infinitely-often one-way function based on an average-case assumption (Q3586759) (← links)
- A Complete Public-Key Cryptosystem (Q3617413) (← links)
- (Q4250220) (← links)
- A fast deterministic algorithm for formulas that have many satisfying assignments (Q4380447) (← links)
- (Q4475671) (← links)
- (Q4501522) (← links)
- On the Limits of Gate Elimination (Q4608608) (← links)
- (Q4736859) (← links)
- (Q4737162) (← links)
- (Q4807964) (← links)
- Local search algorithms for SAT: Worst-case analysis (Q5054860) (← links)
- Semi-algebraic proofs, IPS lower bounds, and the τ-conjecture: can a natural number be negative? (Q5144897) (← links)
- STACS 2004 (Q5309695) (← links)
- Automata, Languages and Programming (Q5466449) (← links)
- Theory and Applications of Satisfiability Testing (Q5713705) (← links)
- MAX SAT approximation beyond the limits of polynomial-time approximation (Q5957907) (← links)
- The power of the binary value principle (Q6057309) (← links)
- Improving \(3N\) circuit complexity lower bounds (Q6184294) (← links)
- Gregory Samuilovich Tseytin (obituary) (Q6184487) (← links)
- Irreducible subcube partitions (Q6199189) (← links)