Combinatorial hardness proofs for polynomial evaluation-Reference-Cited by-同舟云学术

Combinatorial hardness proofs for polynomial evaluation

Published:1998 Issue: Volume: Page:167-175
ISSN:0302-9743
Container-title:Mathematical Foundations of Computer Science 1998
language:
Short-container-title:

Author:

Aldaz Mikel,Heintz Joos,Matera Guillermo,Montaña José L.,Pardo Luis M.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0055765

Reference24 articles.

1. Aldaz M., Heintz J., Matera G., Montaña J.L., Pardo L.M.: Time-space tradeoffs in algebraic complexity theory. J. of Complexity (submitted to), 1996.

2. Baur W.: Simplified lower bounds for polynomials with algebraic coefficients. J. of Complexity 13(1) (1997) 38–41.

3. Belaga E.G.: Some problems involved in the computations of polynomials. Dokl. Akad. Nauk. SSSR 123 (1958) 775–777.

4. Bochnak J., Coste M., Roy M.-F.: Géométrie Algébrique Réelle. Ergebnisse der Mathematik und ihrer Grenzgebiete, 3. Folge, Vol. 12. Springer, 1987.

5. Borodin A., Munro I.: The Computational Complexity of Algebraic and Numeric Problems. American Elsevier, 1975.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Vapnik-Chervonenkis dimension of computer programs which use transcendental elementary operations;Annals of Mathematics and Artificial Intelligence;2009-07-02

2. Vapnik-Chervonenkis Dimension of Parallel Arithmetic Computations;Lecture Notes in Computer Science;2007

3. The Hardness of Polynomial Equation Solving;Foundations of Computational Mathematics;2003-10-01

4. Lower bounds for some decision problems over C;Theoretical Computer Science;2002-04

5. Finiteness Properties of Some Families of GP-Trees;Current Topics in Artificial Intelligence