A note on the use of determinant for proving lower bounds on the size of linear circuits

Information Processing Letters

Volumn 74, Issue 5-6, 2000, Pages 197-201

  Pudlák, Pavel ^a  

^a INSTITUTE OF MATHEMATICS   (Czech Republic)

Author keywords

Computational complexity; Determinant; Matrix

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; ELECTRIC NETWORK ANALYSIS; MATRIX ALGEBRA;

RESTRICTED RIGIDITY;

LINEAR INTEGRATED CIRCUITS;

EID: 0033726085     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(00)00058-2     Document Type: Article

References (11)

1. R. Bellman, Introduction to Matrix Analysis, 2nd edn., McGraw-Hill, New York, 1970.
2. P. Bürgisser, M. Clausen, M.A. Shokrolahi, Algebraic Complexity Theory, Springer, Berlin, 1997.
3. B. Chazelle, A spectral approach to lower bounds, in: Proc. 35th IEEE FOCS, 1994, pp. 674-682.
4. D.Yu. Grigoriev, Using the notion of separability and independence for proving lower bounds on circuit complexity, Notes Leningrad Branch Steklov Math. Inst. 60 (1976) 38-48.
5. S.V. Lokam, Spectral methods for matrix rigidity with applications to size-depth tradeoffs and communication complexity, in: Proc. 36th IEEE FOCS, 1995, pp. 6-15.
6. J. Morgenstern, Note on a lower bound on the linear complexity of the fast Fourier transform, J. ACM 20 (2) (1973) 305-306.
7. J. Morgenstern, The linear complexity of computation, J. ACM 22 (2) (1975) 184-194.
8. N. Nisan, A. Wigderson, On the complexity of bilinear forms, in: Proc. 27th ACM STOC, 1995, pp. 723-732.
9. B.S. Kashin, A.A. Razborov, Improved lower bounds on the rigidity of Hadamard matrices, Math. Notes 63 (4) (1998) 471-475.
10. L.G. Valiant, Graph-theoretic arguments in low level complexity, in: Proc. 6th MFCS, Lecture Notes in Comput. Sci., Vol. 53, Springer, Berlin, 1977, pp. 162-176.
11. ftp://ftp.eccc.uni-trier.de/pub/eccc/reports/1998/TR98-042/index.html (preliminary version of this paper).