The following pages link to (Q4474216):
Displaying 22 items.
- Using elimination theory to construct rigid matrices (Q475335) (← links)
- The NOF multiparty communication complexity of composed functions (Q496305) (← links)
- On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes (Q817830) (← links)
- Complexity measures of sign matrices (Q949752) (← links)
- A linear lower bound on the unbounded error probabilistic communication complexity. (Q1872728) (← links)
- Upper bounds on communication in terms of approximate rank (Q2117081) (← links)
- Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression (Q2316930) (← links)
- The unbounded-error communication complexity of symmetric functions (Q2428632) (← links)
- Threshold circuit lower bounds on cryptographic functions (Q2485284) (← links)
- Polynomial threshold functions and Boolean threshold circuits (Q2514146) (← links)
- Cryptographic hardness under projections for time-bounded Kolmogorov complexity (Q2699976) (← links)
- Vaughan Jones, Kolmogorov Complexity, and the New Complexity Landscape around Circuit Minimization (Q3380367) (← links)
- (Q3653404) (← links)
- Sign rank versus Vapnik-Chervonenkis dimension (Q4610199) (← links)
- New algorithms and lower bounds for circuits with linear threshold gates (Q4612481) (← links)
- Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC$^0$ (Q4957911) (← links)
- A Short List of Equalities Induces Large Sign-Rank (Q5087014) (← links)
- Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity (Q5091770) (← links)
- Unbounded-Error Classical and Quantum Communication Complexity (Q5387749) (← links)
- (Q5875514) (← links)
- Size, Depth and Energy of Threshold Circuits Computing Parity Function. (Q6065463) (← links)
- Upper bounds on communication in terms of approximate rank (Q6635689) (← links)
