Bounded-depth circuits cannot sample good codes (Q692999): 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/s00037-012-0039-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2152587816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Quantum Communication Complexity of Sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylogarithmic Independence Can Fool DNF Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average sensitivity of bounded-depth circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylogarithmic independence fools <i>AC</i> <sup>0</sup> circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cell probe complexity of succinct data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Implementation of Huge Random Objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Assignments of Numbers to Vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the edges of the n-cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random generation of combinatorial structures from a uniform distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant depth circuits, Fourier transform, and learnability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-depth circuits cannot sample good codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cell probe complexity of polynomial evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom bits for constant depth circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Proof of Bazzi’s Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of constructing pseudorandom generators from hard functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extractors for Circuit Sources / rank
 
Normal rank

Latest revision as of 22:52, 5 July 2024

scientific article
Language Label Description Also known as
English
Bounded-depth circuits cannot sample good codes
scientific article

    Statements

    Bounded-depth circuits cannot sample good codes (English)
    0 references
    0 references
    0 references
    7 December 2012
    0 references
    sampling
    0 references
    small depth circuits
    0 references
    noise sensitivity
    0 references
    isoperimetric inequalities
    0 references

    Identifiers