IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF KELLY’S THEOREM (Q2879417): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Perturbed Identity Matrices Have High Rank: Proof and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Locally Decodable Codes, Self-correctable Codes, and t-Private PIR / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Lower Bounds for 2-query LCCs over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5528399 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of Sylvester's problem and its generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence Theorems and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sylvester-Gallai theorems for complex numbers and quaternions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum rank of symmetric matrices described by a graph: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear lower bound on the unbounded error probabilistic communication complexity. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the p-rank of the incidence matrix of a balanced or partially balanced incomplete block design and its applications to error correcting codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalization of a Theorem of Sylvester on the Lines Determined by a Finite Point Set. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Double Diagonal and Cross Latin Squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polarities, quasi-symmetric designs, and Hamada's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blackbox Polynomial Identity Testing for Depth 3 Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: A resolution of the Sylvester-Gallai problem of J.-P. Serre / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Lower Bounds using Linear Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5779426 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalings of matrices which have prespecified row sums and column sums via optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: From sylvester-gallai configurations to rank bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4164821 / rank
 
Normal rank

Revision as of 23:18, 8 July 2024

scientific article
Language Label Description Also known as
English
IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF KELLY’S THEOREM
scientific article

    Statements

    IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF KELLY’S THEOREM (English)
    0 references
    0 references
    0 references
    0 references
    1 September 2014
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references