Toward the KRW composition conjecture: cubic formula lower bounds via communication complexity
From MaRDI portal
(Redirected from Publication:5368737)
Recommendations
- Toward the KRW composition conjecture: cubic formula lower bounds via communication complexity
- Toward better formula lower bounds: an information complexity approach to the KRW composition conjecture
- Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation
- Improved composition theorems for functions and relations
- Communication complexity towards lower bounds on circuit depth
Cited in
(16)- Toward the KRW composition conjecture: cubic formula lower bounds via communication complexity
- On the limits of gate elimination
- The choice and agreement problems of a random function
- On derandomized composition of Boolean functions
- Prediction from partial information and hindsight, with application to circuit lower bounds
- Dag-like communication and its applications
- Small bias requires large formulas
- Improved composition theorems for functions and relations
- Cubic Formula Size Lower Bounds Based on Compositions with Majority
- Hardness magnification near state-of-the-art lower bounds
- scientific article; zbMATH DE number 7250155 (Why is no real title available?)
- Toward better formula lower bounds: an information complexity approach to the KRW composition conjecture
- Security in Communication Networks
- Towards stronger depth lower bounds
- Toward better depth lower bounds: a KRW-like theorem for strong composition
- Circuit depth reductions
This page was built for publication: Toward the KRW composition conjecture: cubic formula lower bounds via communication complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5368737)
