A note on the use of determinant for proving lower bounds on the size of linear circuits
From MaRDI portal
Publication:294768
Recommendations
Cites work
- scientific article; zbMATH DE number 3532851 (Why is no real title available?)
- scientific article; zbMATH DE number 3597878 (Why is no real title available?)
- scientific article; zbMATH DE number 1261801 (Why is no real title available?)
- scientific article; zbMATH DE number 1263251 (Why is no real title available?)
- scientific article; zbMATH DE number 976329 (Why is no real title available?)
- scientific article; zbMATH DE number 3342967 (Why is no real title available?)
- Improved lower bounds on the rigidity of Hadamard matrices
- Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform
- The Linear Complexity of Computation
Cited in
(5)
This page was built for publication: A note on the use of determinant for proving lower bounds on the size of linear circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294768)