Author:
Grigoriev Dima,Karpinski Marek,Smolensky Roman
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference27 articles.
1. M. Ben-Or,Lower Bounds for Algebraic Computation Trees, Proc. 15th ACM STOC (1983), pp. 80?86.
2. A. Björner, L. Lovasz and A. Yao,Linear Decision Trees: Volume Estimates and Topological Bounds, Proc. ACM STOC (1992), pp. 170?177.
3. J. Bruck and R. Smolensky,Polynomial Threshold Functions, AC 0 Functions and Spectral Norms., Proc. IEEE FOCS (1990), pp. 632?641.
4. P. Buergisser, M. Karpinski andT. Lickteig,On Randomized Algebraic Test Complexity, J. of Complexity9 (1993), pp. 231?251.
5. H. Cartan,Elementary Theory of Analytic Functions of One or Several Complex Variables, Addison-Wesley (1963).
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献