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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00224-011-9354-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1995485918 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom Generators in Propositional Proof Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average-Case Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consequences of the provability of <i>NP</i> ⊆ <i>P</i>/<i>poly</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative efficiency of propositional proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Complete Public-Key Cryptosystem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infinitely-often one-way function based on an average-case assumption / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Pseudorandom Generator from any One-way Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Robust Combiners for Oblivious Transfer and Other Primitives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural complexity of AvgBPP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional proof systems, the consistency of first order theories and the complexity of computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the weak pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tautologies from Pseudo-Random Generators / rank
 
Normal rank
Property / cites work
 
Property / cites work: One way functions and pseudorandom generators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226453 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speedup for natural problems and noncomputability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On reducibility and symmetry of disjoint NP pairs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263798 / rank
 
Normal rank

Latest revision as of 22:53, 5 July 2024

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
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references