The following pages link to (Q4164821):
Displaying 50 items.
- Combinatorial PCPs with short proofs (Q260390) (← links)
- A remark on matrix rigidity (Q293150) (← links)
- A note on the use of determinant for proving lower bounds on the size of linear circuits (Q294768) (← links)
- Complexity of linear circuits and geometry (Q300885) (← links)
- Kolmogorov width of discrete linear spaces: an approach to matrix rigidity (Q301519) (← links)
- An algorithm twisted from generalized ADMM for multi-block separable convex minimization models (Q313627) (← links)
- Zero-information protocols and unambiguity in Arthur-Merlin communication (Q343848) (← links)
- More on average case vs approximation complexity (Q430823) (← links)
- Arithmetic circuits: the chasm at depth four gets wider (Q442109) (← links)
- On a theorem of Razborov (Q445247) (← links)
- Using elimination theory to construct rigid matrices (Q475335) (← links)
- On matrix rigidity and locally self-correctable codes (Q645122) (← links)
- Min-rank conjecture for log-depth circuits (Q657911) (← links)
- The complexity of explicit constructions (Q693069) (← links)
- The complexity of depth-3 circuits computing symmetric Boolean functions (Q845823) (← links)
- On rigid matrices and \(U\)-polynomials (Q901935) (← links)
- Rigidity of a simple extended lower triangular matrix (Q963424) (← links)
- Entropy of operators or why matrix multiplication is hard for depth-two circuits (Q970107) (← links)
- On the guessing number of shift graphs (Q1026230) (← links)
- Representing \((0,1)\)-matrices by Boolean circuits (Q1045160) (← links)
- Lower bounds in algebraic computational complexity (Q1057648) (← links)
- Time-space tradeoffs for computing functions, using connectivity properties of their circuits (Q1140426) (← links)
- Size bounds for superconcentrators (Q1170885) (← links)
- Invariant and geometric aspects of algebraic complexity theory. I (Q1176389) (← links)
- The computational complexity of some problems of linear algebra (Q1307698) (← links)
- Shallow grates (Q1314391) (← links)
- Non-deterministic communication complexity with few witnesses (Q1337464) (← links)
- Some combinatorial-algebraic problems from complexity theory (Q1344621) (← 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)
- Which problems have strongly exponential complexity? (Q1604206) (← links)
- Static-memory-hard functions, and modeling the cost of space vs. time (Q1629397) (← links)
- Local reduction (Q1641001) (← links)
- The landscape of communication complexity classes (Q1653337) (← links)
- Matrix rigidity of random Toeplitz matrices (Q1653338) (← links)
- \(\mathrm{AC}^{0}\circ \mathrm{MOD}_{2}\) lower bounds for the Boolean inner product (Q1671999) (← links)
- Size-treewidth tradeoffs for circuits computing the element distinctness function (Q1702852) (← links)
- Identifying an unknown code by partial Gaussian elimination (Q1727382) (← links)
- Matrix rigidity (Q1970501) (← links)
- Some structural properties of low-rank matrices related to computational complexity (Q1978702) (← 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)
- Average-case rigidity lower bounds (Q2117087) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- Matrix and tensor rigidity and \(L_p\)-approximation (Q2145080) (← links)
- Improved bounds on the an-complexity of \(O(1)\)-linear functions (Q2159467) (← links)
- Quadratic lower bounds for algebraic branching programs and formulas (Q2159469) (← links)
- The function-inversion problem: barriers and opportunities (Q2175919) (← links)
- Parameterized low-rank binary matrix approximation (Q2218414) (← links)
- On the complexity of matrix rank and rigidity (Q2268340) (← links)
