scientific article
From MaRDI portal
Publication:3990226
zbMath0753.15011MaRDI QIDQ3990226
Publication date: 28 June 1992
Full work available at URL: https://eudml.org/doc/20325
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
triangular matrixoptimal decompositionsrigidity of matriceslower bounds to complexitysize of circuits
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Matrices of integers (15B36) Vector spaces, linear dependence, rank, lineability (15A03)
Related Items (6)
A remark on matrix rigidity ⋮ Complexity of linear circuits and geometry ⋮ Some combinatorial-algebraic problems from complexity theory ⋮ Min-rank conjecture for log-depth circuits ⋮ Rigidity of a simple extended lower triangular matrix ⋮ Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity
This page was built for publication:
