31 citations · 48 across the 11 of their papers we have counts for
Showing 2007Show all
2 papers · 1 filter
cs.CC2007★ 1 cited
Probabilistic communication complexity over the reals
Dima Grigoriev
Deterministic and probabilistic communication protocols are introduced in which parties can exchange the values of polynomials (rather than bits in the usual setting). It is establ…
math.AP2007★ 2 cited
Complexity of Janet basis of a D-module
Alexander Chistov, Dima Grigoriev
We prove a double-exponential upper bound on the degree and on the complexity of constructing a Janet basis of a -module. This generalizes a well known bound on the complexity o…