Complexity Lower Bounds for Approximation Algebraic Computation Trees

Felipe Cucker; Dima Grigoriev

doi:10.1006/jcom.1999.0519

Complexity Lower Bounds for Approximation Algebraic Computation Trees

Journal of Complexity ◽

10.1006/jcom.1999.0519 ◽

1999 ◽

Vol 15 (4) ◽

pp. 499-512 ◽

Cited By ~ 1

Author(s):

Felipe Cucker ◽

Dima Grigoriev

Keyword(s):

Lower Bounds ◽

Algebraic Computation ◽

Complexity Lower Bounds ◽

Computation Trees

Download Full-text

Complexity lower bounds for computation trees with elementary transcendental function gates

Proceedings 35th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1994.365736 ◽

2002 ◽

Cited By ~ 2

Author(s):

D. Grigoriev ◽

N. Vorobjov

Keyword(s):

Lower Bounds ◽

Transcendental Function ◽

Complexity Lower Bounds ◽

Computation Trees

Download Full-text

Complexity lower bounds for computation trees with elementary transcendental function gates

Theoretical Computer Science ◽

10.1016/0304-3975(95)00159-x ◽

1996 ◽

Vol 157 (2) ◽

pp. 185-214 ◽

Cited By ~ 6

Author(s):

D. Grigoriev ◽

N. Vorobjov

Keyword(s):

Lower Bounds ◽

Transcendental Function ◽

Complexity Lower Bounds ◽

Computation Trees

Download Full-text

Lower bounds for the non-linear complexity of algebraic computation trees with integer inputs

Computational Complexity ◽

10.1007/bf01200063 ◽

1991 ◽

Vol 1 (3) ◽

pp. 257-268 ◽

Cited By ~ 1

Author(s):

Michael D. Hirsch

Keyword(s):

Lower Bounds ◽

Linear Complexity ◽

Algebraic Computation ◽

Non Linear ◽

Computation Trees

Download Full-text

On Topological Lower Bounds for Algebraic Computation Trees

Foundations of Computational Mathematics ◽

10.1007/s10208-015-9283-7 ◽

2015 ◽

Vol 17 (1) ◽

pp. 61-72 ◽

Cited By ~ 1

Author(s):

Andrei Gabrielov ◽

Nicolai Vorobjov

Keyword(s):

Lower Bounds ◽

Algebraic Computation ◽

Computation Trees

Download Full-text

Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains

SIAM Journal on Computing ◽

10.1137/0220041 ◽

1991 ◽

Vol 20 (4) ◽

pp. 655-668 ◽

Cited By ~ 40

Author(s):

Andrew Chi-Chih Yao

Keyword(s):

Lower Bounds ◽

Algebraic Computation ◽

Computation Trees ◽

Finite Domains

Download Full-text

Lower bounds for algebraic computation trees of functions with finite domains

Advances in Computing and Information — ICCI '91 - Lecture Notes in Computer Science ◽

10.1007/3-540-54029-6_154 ◽

1991 ◽

pp. 55-65

Author(s):

Nader H. Bshouty

Keyword(s):

Lower Bounds ◽

Algebraic Computation ◽

Computation Trees ◽

Finite Domains

Download Full-text

Complexity lower bounds for randomized computation trees over zero characteristic fields

Computational Complexity ◽

10.1007/s000370050002 ◽

1999 ◽

Vol 8 (4) ◽

pp. 316-329 ◽

Cited By ~ 1

Author(s):

D. Grigoriev

Keyword(s):

Lower Bounds ◽

Zero Characteristic ◽

Complexity Lower Bounds ◽

Randomized Computation ◽

Computation Trees

Download Full-text

Lower bounds for algebraic computation trees

Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83 ◽

10.1145/800061.808735 ◽

1983 ◽

Cited By ~ 188

Author(s):

Michael Ben-Or

Keyword(s):

Lower Bounds ◽

Algebraic Computation ◽

Computation Trees

Download Full-text

Lower bounds for algebraic computation trees with integer inputs

30th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1989.63495 ◽

1989 ◽

Cited By ~ 12

Author(s):

A.C.-C. Yao

Keyword(s):

Lower Bounds ◽

Algebraic Computation ◽

Computation Trees

Download Full-text

Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints

ACM Transactions on Computation Theory ◽

10.1145/3397484 ◽

2020 ◽

Vol 12 (3) ◽

pp. 1-19 ◽

Cited By ~ 1

Author(s):

Dušan Knop ◽

Michał Pilipczuk ◽

Marcin Wrochna

Keyword(s):

Linear Programming ◽

Lower Bounds ◽

Integer Linear Programming ◽

Complexity Lower Bounds

Download Full-text