scientific article; zbMATH DE number 1261801

zbMath0937.68515MaRDI QIDQ4231904

Satyanarayana V. Lokam

Publication date: 26 April 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (14)

On relations between counting communication complexity classes ⋮ A remark on matrix rigidity ⋮ A note on the use of determinant for proving lower bounds on the size of linear circuits ⋮ On rigid matrices and \(U\)-polynomials ⋮ Matrix rigidity ⋮ Matrix Rigidity from the Viewpoint of Parameterized Complexity ⋮ Complexity measures of sign matrices ⋮ On the complexity of matrix rank and rigidity ⋮ The computational complexity of some problems of linear algebra ⋮ On the rigidity of Vandermonde matrices ⋮ Improved lower bounds on the rigidity of Hadamard matrices ⋮ The computational complexity of some problems of linear algebra ⋮ Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity ⋮ On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes

This page was built for publication: