Lower Bounds for Arithmetic Circuits via Partial Serivatives (Preliminary Version).
暂无分享,去创建一个
[1] Michael Clausen,et al. Algebraic complexity theory , 1997, Grundlehren der mathematischen Wissenschaften.
[2] Noam Nisan,et al. Lower bounds for non-commutative computation , 1991, STOC '91.
[3] V. Strassen. Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten , 1973 .
[4] Roman Smolensky. On interpolation by analytic functions with special properties and some weak lower bounds on the size of circuits with symmetric gates , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[5] K. Ramachandra,et al. Vermeidung von Divisionen. , 1973 .
[6] Leslie G. Valiant,et al. Fast Parallel Computation of Polynomials Using Few Processors , 1983, SIAM J. Comput..
[7] Leslie G. Valiant,et al. Negation can be exponentially powerful , 1979, Theor. Comput. Sci..
[8] Martin Tompa,et al. A Direct Version of Shamir and Snir's Lower Bounds on Monotone Circuit Depth , 1994, Inf. Process. Lett..