![]() | ![]() |
Ask others: ACM DL/Guide -
- CSB - MetaPress - Google - Bing - Yahoo
| 46 | Edward A. Hirsch, Sergey I. Nikolenko: A Feebly Secure Trapdoor Function. CSR 2009: 129-142 | |
| 43 | Edward A. Hirsch, Arist Kojevnikov, Alexander S. Kulikov, Sergey I. Nikolenko: Complexity of Semialgebraic Proofs with Restricted Degree of Falsity. JSAT 6(1-3): 53-69 (2009) | |
| 34 | Edward A. Hirsch, Sergey I. Nikolenko: Simulating Cutting Plane Proofs with Restricted Degree of Falsity by Resolution. SAT 2005: 135-142 | |
| 31 | Edward A. Hirsch, Sergey I. Nikolenko: Simulating Cutting Plane proofs with restricted degree of falsity by Resolution Electronic Colloquium on Computational Complexity (ECCC)(006): (2005) |
Selection of 4 from 54 records - Edward A. Hirsch has 35 coauthors
Last update 2012-09-10 CET by the DBLP Team —
Content released under the ODC-BY 1.0 license — See also our legal information page