Theory and Applications of Models of Computation

DOI10.1007/11750321zbMath1178.68284OpenAlexW4296156427MaRDI QIDQ5898884

Satyanarayana V. Lokam

Publication date: 30 April 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11750321

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items (8)

Complexity of linear circuits and geometry ⋮ New applications of the polynomial method: The cap set conjecture and beyond ⋮ On a theorem of Razborov ⋮ On matrix rigidity and locally self-correctable codes ⋮ Using elimination theory to construct rigid matrices ⋮ Rigidity of a simple extended lower triangular matrix ⋮ Fourier and circulant matrices are not rigid ⋮ Efficient Construction of Rigid Matrices Using an NP Oracle

This page was built for publication: Theory and Applications of Models of Computation