Almost \(k\)-wise independence and hard Boolean functions. (Q1401305): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Simple Constructions of Almost k-wise Independent Random Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A very simple function that requires exponential size read-once branching programs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple function that requires exponential size read-once branching programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy of contact circuits and lower bounds on their complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating the eraser Turing machine classes \(L_ e\), \(NL_ e\), \(co- NL_ e\) and \(P_ e\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small-Bias Probability Spaces: Efficient Constructions and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound for Integer Multiplication with Read-Once Branching Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3822097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Natural proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved boolean formulas for the Ramsey graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4287364 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of branching programs and decision trees for clique functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347300 / rank
 
Normal rank

Latest revision as of 09:50, 6 June 2024

scientific article
Language Label Description Also known as
English
Almost \(k\)-wise independence and hard Boolean functions.
scientific article

    Statements

    Almost \(k\)-wise independence and hard Boolean functions. (English)
    0 references
    0 references
    17 August 2003
    0 references
    0 references
    read-once branching program
    0 references