Towards an Almost Quadratic Lower Bound on the Monotone Circuit Complexity of the Boolean Convolution (Q2988838): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The monotone circuit complexity of Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3786412 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Negations in Boolean Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(\Omega (n^{4/3})\) lower bound on the monotone network complexity of the \(n\)-th degree convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Monotone Networks for Certain Bilinear Forms, Routing Problems, Sorting, and Merging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Powers of tensors and fast matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone switching circuits and Boolean matrix product / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of monotone networks for Boolean matrix product / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shifting Graphs and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Negative Thinking in Multiplying Boolean Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of matrix product / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3758729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on the number of additions in monotone computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian elimination is not optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean functions whose monotone complexity is of size \(n^ 2\) / log n / rank
 
Normal rank
Property / cites work
 
Property / cites work: An n3/2 lower bound on the monotone network complexity of the Boolean convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplying matrices faster than coppersmith-winograd / rank
 
Normal rank
Property / cites work
 
Property / cites work: All pairs shortest paths using bridging sets and rectangular matrix multiplication / rank
 
Normal rank

Latest revision as of 20:09, 13 July 2024

scientific article
Language Label Description Also known as
English
Towards an Almost Quadratic Lower Bound on the Monotone Circuit Complexity of the Boolean Convolution
scientific article

    Statements

    Towards an Almost Quadratic Lower Bound on the Monotone Circuit Complexity of the Boolean Convolution (English)
    0 references
    19 May 2017
    0 references
    semi-disjoint bilinear form
    0 references
    Boolean vector convolution
    0 references
    monotone Boolean circuit complexity
    0 references
    0 references

    Identifiers