On rigid matrices and \(U\)-polynomials
From MaRDI portal
Publication:901935
DOI10.1007/s00037-015-0112-9zbMath1333.68120OpenAlexW2218040375MaRDI QIDQ901935
Publication date: 6 January 2016
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00037-015-0112-9
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A remark on matrix rigidity
- A note on matrix rigidity
- Explicit construction of linear sized tolerant networks
- Improved lower bounds on the rigidity of Hadamard matrices
- The Remote Point Problem, Small Bias Spaces, and Expanding Generator Sets
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Complexity Lower Bounds using Linear Algebra
- Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
- Expander graphs and their applications
- Deterministic Approximation Algorithms for the Nearest Codeword Problem
- Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
- Simple Constructions of Almost k-wise Independent Random Variables
- Random Cayley graphs and expanders
- Analysis of Boolean Functions
- Constructing Small-Bias Sets from Algebraic-Geometric Codes
This page was built for publication: On rigid matrices and \(U\)-polynomials
