On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography (Q693058)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography |
scientific article; zbMATH DE number 6113700
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography |
scientific article; zbMATH DE number 6113700 |
Statements
On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography (English)
0 references
7 December 2012
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
0.7714340090751648
0 references
0.7609352469444275
0 references
