Edward A Hirsch


Ontology type: schema:Person     


Person Info

NAME

Edward A

SURNAME

Hirsch

Publications in SciGraph latest 50 shown

  • 2015-05 Preface in THEORY OF COMPUTING SYSTEMS
  • 2013-01 Feebly secure cryptographic primitives in JOURNAL OF MATHEMATICAL SCIENCES
  • 2013-01 Optimal heuristic algorithms for the image of an injective function in JOURNAL OF MATHEMATICAL SCIENCES
  • 2012-08 On Optimal Heuristic Randomized Semidecision Procedures, with Applications to Proof Complexity and Cryptography in THEORY OF COMPUTING SYSTEMS
  • 2011 Satisfiability Certificates Verifiable in Subexponential Time in THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2011
  • 2009-05 Time hierarchies for cryptographic function inversion with advice in JOURNAL OF MATHEMATICAL SCIENCES
  • 2009 A Feebly Secure Trapdoor Function in COMPUTER SCIENCE - THEORY AND APPLICATIONS
  • 2008 An Infinitely-Often One-Way Function Based on an Average-Case Assumption in LOGIC, LANGUAGE, INFORMATION AND COMPUTATION
  • 2006 Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms in ALGORITHMS AND COMPLEXITY
  • 2006 Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas in SAT 2005
  • 2005-10 Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas in JOURNAL OF AUTOMATED REASONING
  • 2005 Simulating Cutting Plane Proofs with Restricted Degree of Falsity by Resolution in THEORY AND APPLICATIONS OF SATISFIABILITY TESTING
  • 2004 Algorithms for SAT Based on Search in Hamming Balls in STACS 2004
  • 2004 Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2003-11 Algorithms for Sat and Upper Bounds on Their Complexity in JOURNAL OF MATHEMATICAL SCIENCES
  • 2002-02-21 Complexity of Semi-algebraic Proofs in STACS 2002
  • 2002-02-18 Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2002 Exponential Lower Bound for Static Semi-algebraic Proofs in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2000 A New Algorithm for MAX-2-SAT in STACS 2000
  • 1998 Local search algorithms for SAT: Worst-case analysis in ALGORITHM THEORY — SWAT'98
  • Affiliations

    JSON-LD is the canonical representation for SciGraph data.

    TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

    [
      {
        "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
        "affiliation": [
          {
            "affiliation": {
              "id": "https://www.grid.ac/institutes/grid.426543.2", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }
        ], 
        "familyName": "Hirsch", 
        "givenName": "Edward A", 
        "id": "sg:person.010146471255.40", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010146471255.40"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T13:50", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-uberresearch-data-dimensions-researchers-20181010/20181011/dim_researchers/base/researchers_1619.json", 
        "type": "Person"
      }
    ]
     

    Download the RDF metadata as:  json-ld nt turtle xml License info

    HOW TO GET THIS DATA PROGRAMMATICALLY:

    JSON-LD is a popular format for linked data which is fully compatible with JSON.

    curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/person.010146471255.40'

    N-Triples is a line-based linked data format ideal for batch operations.

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/person.010146471255.40'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/person.010146471255.40'

    RDF/XML is a standard XML format for linked data.

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/person.010146471255.40'


     




    Preview window. Press ESC to close (or click here)


    ...