The following pages link to Halfspace matrices (Q937198):
Displayed 17 items.
- Improved approximation of linear threshold functions (Q371200) (← links)
- On a theorem of Razborov (Q445247) (← links)
- Unbounded-error quantum query complexity (Q638526) (← links)
- The landscape of communication complexity classes (Q1653337) (← links)
- A new central limit theorem and decomposition for Gaussian polynomials, with an application to deterministic approximate counting (Q1656545) (← links)
- The hardest halfspace (Q1983325) (← links)
- The unbounded-error communication complexity of symmetric functions (Q2428632) (← links)
- Quantum matchgate computations and linear threshold gates (Q3076715) (← links)
- Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization (Q4575825) (← links)
- Sign rank versus Vapnik-Chervonenkis dimension (Q4610199) (← links)
- (Q4612486) (← links)
- (Q4612487) (← links)
- Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC$^0$ (Q4957911) (← links)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
- Sign rank vs discrepancy (Q5092468) (← links)
- (Q5093405) (← links)
- Adversarial manifold estimation (Q6118078) (← links)