D. Grigoriev

activity

20022004

most citedPolynomial-time computing over quadratic maps I: sampling in real algebraic sets

31 citations · 42 across the 6 of their papers we have counts for

collaborators

Showing cs.SCShow all

2 papers · 1 filter

cs.SC2004★ 31 cited

Polynomial-time computing over quadratic maps I: sampling in real algebraic sets

Dima Grigoriev, Dmitrii V. Pasechnik

Given a quadratic map Q : K^n -> K^k defined over a computable subring D of a real closed field K, and a polynomial p(Y_1,...,Y_k) of degree d, we consider the zero set Z=Z(p(Q(X))…

cs.SC2003

Weak Bezout inequality for D-modules

Dima Grigoriev

Let ${w_{i, j}}_{1 \leq i \leq n, 1 \leq j \leq s} \subset L_{m} = F (X_{1}, ..., X_{m}) [\frac{\partial}{\partial X _{1}}, ..., \frac{\partial}{\partial X _{m}}]$ be linear partial differential operato…