Complexity of hard-core set proofs (Q451110): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00037-011-0003-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2084411549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2784326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(BPP\) has subexponential time simulations unless \(EXPTIME\) has publishable proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boosting a weak learning algorithm by majority / rank
 
Normal rank
Property / cites work
 
Property / cites work: Majority gates vs. general weighted threshold gates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold circuits of bounded depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Nondeterminism to Amplify Hardness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Key agreement from weak bit agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boosting and hard-core set construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Hard-Core Set Constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Hardness Amplification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness amplification within NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom generators without the XOR lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniform amplification of hardness in NP / rank
 
Normal rank

Latest revision as of 17:47, 5 July 2024

scientific article
Language Label Description Also known as
English
Complexity of hard-core set proofs
scientific article

    Statements

    Complexity of hard-core set proofs (English)
    0 references
    0 references
    0 references
    0 references
    21 September 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    hard-core set
    0 references
    hardness amplification
    0 references
    black-box proofs
    0 references
    0 references