On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography (Q693058)

From MaRDI portal
Revision as of 23:53, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography
scientific article

    Statements

    On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 December 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    propositional proof complexity
    0 references
    optimal algorithm
    0 references
    infinitely-often one-way
    0 references
    heuristic algorithm
    0 references
    heuristic acceptor
    0 references
    recursively enumerable languages
    0 references
    0 references