The following pages link to The Sign-Rank of AC$^0$ (Q3053151):
Displaying 33 items.
- Essential sign change numbers of full sign pattern matrices (Q301845) (← links)
- Linear algebraic methods in communication complexity (Q417541) (← links)
- Minimum (maximum) rank of sign pattern tensors and sign nonsingular tensors (Q490877) (← links)
- The landscape of communication complexity classes (Q1653337) (← links)
- Minimum ranks of sign patterns and zero-nonzero patterns and point-hyperplane configurations (Q1791686) (← links)
- The hardest halfspace (Q1983325) (← links)
- Communication complexity with small advantage (Q2182866) (← links)
- Revealed preference dimension via matrix sign rank (Q2190381) (← links)
- Rank conditions for sign patterns that allow diagonalizability (Q2305912) (← links)
- Query-to-communication lifting for \(\mathsf{P}^{\mathsf{NP}}\) (Q2422767) (← links)
- Polynomial threshold functions and Boolean threshold circuits (Q2514146) (← links)
- Rational realization of the minimum ranks of nonnegative sign pattern matrices (Q2828823) (← links)
- Sign patterns with minimum rank 2 and upper bounds on minimum ranks (Q2850984) (← links)
- Breaking the Minsky--Papert Barrier for Constant-Depth Circuits (Q4554070) (← links)
- The Power of Asymmetry in Constant-Depth Circuits (Q4562278) (← 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)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
- A Short List of Equalities Induces Large Sign-Rank (Q5087014) (← links)
- (Q5091179) (← links)
- Sign rank vs discrepancy (Q5092468) (← links)
- (Q5093405) (← links)
- Query-to-Communication Lifting for BPP (Q5117373) (← links)
- A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$ (Q5117375) (← links)
- On the Power of Statistical Zero Knowledge (Q5117376) (← links)
- Algorithmic Polynomials (Q5138783) (← links)
- (Q5140844) (← links)
- (Q5158501) (← links)
- (Q5875514) (← links)
- Rectangles Are Nonnegative Juntas (Q5890971) (← links)
- Optimal bounds for sign-representing the intersection of two halfspaces by polynomials (Q5891428) (← links)
- Size, Depth and Energy of Threshold Circuits Computing Parity Function. (Q6065463) (← links)
