Pages that link to "Item:Q1330798"
From MaRDI portal
The following pages link to Communication in bounded depth circuits (Q1330798):
Displayed 26 items.
- A remark on matrix rigidity (Q293150) (← links)
- On a theorem of Razborov (Q445247) (← links)
- Min-rank conjecture for log-depth circuits (Q657911) (← links)
- High girth augmented trees are huge (Q739384) (← links)
- Entropy of operators or why matrix multiplication is hard for depth-two circuits (Q970107) (← links)
- Representing \((0,1)\)-matrices by Boolean circuits (Q1045160) (← links)
- Improved lower bounds on the rigidity of Hadamard matrices (Q1280658) (← links)
- Superconcentrators of depths 2 and 3; odd levels help (rarely) (Q1318476) (← links)
- Some combinatorial-algebraic problems from complexity theory (Q1344621) (← links)
- Algebraic techniques in communication complexity (Q1350289) (← links)
- On the rigidity of Vandermonde matrices (Q1566747) (← links)
- Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity (Q1604200) (← links)
- Affine projections of symmetric polynomials. (Q1872730) (← links)
- Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors (Q1928497) (← links)
- Matrix rigidity (Q1970501) (← links)
- Matrix rank and communication complexity (Q1970502) (← links)
- Lower bounds for matrix factorization (Q2041242) (← links)
- Real \(\tau \)-conjecture for sum-of-squares: a unified approach to lower bound and derandomization (Q2117077) (← links)
- A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle (Q2378541) (← links)
- On complexity of linear operators on the class of circuits of depth 2 (Q3184524) (← links)
- Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements (Q3225912) (← links)
- Lower Bounds for Depth-2 and Depth-3 Boolean Circuits with Arbitrary Gates (Q3503631) (← links)
- Lower bounds for matrix factorization (Q5092452) (← links)
- A super-quadratic lower bound for depth four arithmetic circuits (Q5092474) (← links)
- Efficient Construction of Rigid Matrices Using an NP Oracle (Q5863325) (← links)
- Circuit complexity of regular languages (Q5895106) (← links)