Toward the KRW composition conjecture: cubic formula lower bounds via communication complexity (Q1616616): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: How to compress interactive communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choosing, agreeing, and eliminating in communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size-depth tradeoffs for Boolean formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive information complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Equals Amortized Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parallel Evaluation of General Arithmetic Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mining circuit lower bound proofs for meta-algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication complexity towards lower bounds on circuit depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amortized Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward better formula lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone separation of logarithmic space from logarithmic depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shrinkage Exponent of de Morgan Formulas is 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4287360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The effect of random restrictions on formula size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean function complexity. Advances and frontiers. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive PCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional Covers and Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super-logarithmic depth lower bounds via the direct sum in communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone Circuits for Connectivity Require Super-Logarithmic Depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Method of determining lower bounds for the complexity of \(\Pi\)-circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average-case lower bounds for formula size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shrinkage of de Morgan formulae under restriction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone circuits for matching require linear depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of matrix methods to the theory of lower bounds in computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3281059 / rank
 
Normal rank

Revision as of 06:21, 17 July 2024

scientific article
Language Label Description Also known as
English
Toward the KRW composition conjecture: cubic formula lower bounds via communication complexity
scientific article

    Statements

    Toward the KRW composition conjecture: cubic formula lower bounds via communication complexity (English)
    0 references
    0 references
    0 references
    7 November 2018
    0 references
    communication complexity
    0 references
    de Morgan formulas
    0 references
    lower bounds
    0 references
    Karchmer-Wigderson relations
    0 references
    Karchmer-Wigderson games
    0 references
    KRW conjecture
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers