Min-rank conjecture for log-depth circuits (Q657911): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q123282575, #quickstatements; #temporary_batch_1712286835472
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Superconcentrators of depths 2 and 3; odd levels help (rarely) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Circuits over $\operatorname{GF}(2)$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3412385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3831127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on matrix rigidity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3487569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy of operators or why matrix multiplication is hard for depth-two circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the rigidity of Vandermonde matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Linear Complexity of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superconcentrators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superconcentrators of depth 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication in bounded depth circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3990226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On shifting networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean Circuits, Tensor Ranks, and Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Matrix Product in Bounded Depth Circuits with Arbitrary Gates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved lower bounds on the rigidity of Hadamard matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark on matrix rigidity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on Matrix Rigidity Via a Quantum Argument / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4164821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036702 / rank
 
Normal rank

Latest revision as of 20:26, 4 July 2024

scientific article
Language Label Description Also known as
English
Min-rank conjecture for log-depth circuits
scientific article

    Statements

    Min-rank conjecture for log-depth circuits (English)
    0 references
    0 references
    0 references
    11 January 2012
    0 references
    0 references
    Boolean circuits
    0 references
    partial matrix
    0 references
    matrix completion
    0 references
    min-rank
    0 references
    matrix rigidity
    0 references
    sum-sets
    0 references
    Cayley graphs
    0 references
    error-correcting codes
    0 references
    0 references
    0 references