BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × Spain
4 × USA
Collaborated with:
M.Karpinski E.A.Hirsch D.V.Pasechnik N.Vorobjov S.R.Buss R.Impagliazzo T.Pitassi F.M.a.d.Heide R.Smolensky
Talks about:
lower (6) bound (6) algebra (3) random (3) exponenti (2) decis (2) tree (2) polyhedron (1) membership (1) polynomi (1)

Person: Dima Grigoriev

DBLP DBLP: Grigoriev:Dima

Contributed to:

ICALP 20022002
STOC 19991999
STOC 19981998
STOC 19971997
STOC 19961996
STOC 19941994

Wrote 7 papers:

ICALP-2002-GrigorievHP #algebra #bound #exponential #proving
Exponential Lower Bound for Static Semi-algebraic Proofs (DG, EAH, DVP), pp. 257–268.
STOC-1999-BussGIP #calculus #linear #polynomial
Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes (SRB, DG, RI, TP), pp. 547–556.
STOC-1998-Grigoriev #bound #complexity #random
Randomized Complexity Lower Bounds (DG), pp. 219–223.
STOC-1998-GrigorievK #bound #exponential
An Exponential Lower Bound for Depth 3 Arithmetic Circuits (DG, MK), pp. 577–582.
STOC-1997-GrigorievK #bound #random
Randomized Ω(n²) Lower Bound for Knapsack (DG, MK), pp. 76–85.
STOC-1996-GrigorievKHS #algebra #bound #random
A Lower Bound for Randomized Algebraic Decision Trees (DG, MK, FMadH, RS), pp. 612–619.
STOC-1994-GrigorievKV #algebra #bound #testing
Lower bounds on testing membership to a polyhedron by algebraic decision trees (DG, MK, NV), pp. 635–644.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.