Searching for authors named "Dima Grigoriev" – sorted by Relevance.
47 documents found, showing 1 through 10.
Next 10 →
-
Topological Complexity of the Range Searching
- …Topological Complexity of the Range Searching Dima Grigoriev IMR Universit'e de Rennes-1 Rennes…
- Cited by 3 (0 self) – Add To MetaCart
-
Nearly Sharp Complexity Bounds For Multiprocessor Algebraic Computations
- …NEARLY SHARP COMPLEXITY BOUNDS FOR MULTIPROCESSOR ALGEBRAIC COMPUTATIONS Dima Grigoriev…
- Cited by 7 (4 self) – Add To MetaCart
-
Approximation and complexity: Liouvillean type theorems for linear differential equations on an interval
- … on an interval Dima Grigoriev Abstract We prove a lower bound on approximations on an interval of a function…
- Cited by 1 (1 self) – Add To MetaCart
-
Complexity Lower Bounds For Randomized Computation Trees Over Zero Characteristic Fields
- …. Grigoriev IMR Universit' e Rennes-1 Beaulieu 35042 Rennes France dima@(email omitted); We obtain a…
- Cited by 2 (2 self) – Add To MetaCart
-
Constructing Double-Exponential Number of Vectors of Multipilicities of Solutions of Polynomial Systems
- … systems Dima Grigoriev Abstract In [GV] it was proved an upper bound d O(( n+d n )) on the number…
- Cited by 1 (0 self) – Add To MetaCart
-
Linear Lower Bound on Degrees of Positivstellensatz Calculus Proofs for the Parity
- …Linear Lower Bound on Degrees of Positivstellensatz Calculus Proofs for the Parity Dima Grigoriev…
- Cited by 5 (3 self) – Add To MetaCart
-
Randomized Ω(n²) Lower Bound for Knapsack
- …Randomized\Omega (n 2 ) Lower Bound for Knapsack Dima Grigoriev Marek Karpinski y Abstract…
- Add To MetaCart
-
Quadratic Randomized Lower Bound for the Knapsack Problem
- …Quadratic Randomized Lower Bound for the Knapsack Problem Dima Grigoriev y Marek Karpinski z…
- Add To MetaCart
-
On the power of real Turing machines over binary inputs
- … Balmes 132, Barcelona 08008 SPAIN e-mail: cucker@(email omitted); Dima Grigoriev y Depts. of Comp. Science…
- Cited by 17 (2 self) – Add To MetaCart
-
Complexity Lower Bounds for Approximation Algebraic Computation Trees
- …@(email omitted); Dima Grigoriev IMR Universit'e de Rennes I Campus de Beaulieu, Rennes 35042 FRANCE e-mail: grigoriev…
- Cited by 3 (0 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
