#### Filter Results:

- Full text PDF available (42)

#### Publication Year

1973

2019

- This year (5)
- Last 5 years (42)
- Last 10 years (78)

#### Supplemental Content

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Dima Grigoriev
- Theor. Comput. Sci.
- 2001

Abstract In this paper we establish a linear (thereby, sharp) lower bound on degrees of Positivstellensatz calculus refutations over a real field introduced in Grigoriev and Vorobjov (Ann. Pure Appl.… (More)

- Dima Grigoriev, Nikolai Vorobjov
- J. Symb. Comput.
- 1988

Let the polynomials f"1,..., f"[email protected]? @?[X"1,..., X"n] have degrees deg (f"i) = 0,..., f"k >= 0. In the case of a positive answer the algorithm constructs a certain finite set of… (More)

- Samuel R. Buss, Dima Grigoriev, Russell Impagliazzo, Toniann Pitassi
- Proceedings. Fourteenth Annual IEEE Conference on…
- 1999

Two important algebraic proof systems are the Nullstellensatz system and the polynomial calculus (also called the Grobner system). The Nullstellensatz system is a propositional proof system based on… (More)

- Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik
- STACS
- 2001

Proof systems for polynomial inequalities in 0-1 variables include the well-studied Cutting Planes proof system (CP) and the Lovasz-Schrijver calculi (LS) utilizing linear, respectively, quadratic,… (More)

- Dima Grigoriev
- computational complexity
- 2001

Abstract. A lower bound is established on degrees of Positivstellensatz calculus refutations (over a real field) introduced in (Grigoriev & Vorobjov 2001; Grigoriev 2001) for the knapsack problem.… (More)

- Alexander L. Chistov, Dima Grigoriev
- MFCS
- 1984

An algorithm is described producing for each formula of the first order theory of algebraically closed fields an equivalent free of quantifiers one. Denote by N a number of polynomials occuring in… (More)

- Dima Grigoriev, Fritz Schwarz
- Computing
- 2004

The problem of factoring a linear partial differential operator is studied. An algorithm is designed which allows one to factor an operator when its symbol is separable, and if in addition the… (More)

- Dima Grigoriev, Marek Karpinski
- 28th Annual Symposium on Foundations of Computer…
- 1987

It is shown that the problem of deciding and constructing a perfect matching in bipartite graphs G with the polynomial permanents of their n × n adjacency matrices A (perm(A) = nO(1)) are in the… (More)

- Dima Grigoriev, Nikolai Vorobjov
- Ann. Pure Appl. Logic
- 2001

Abstract We introduce two versions of proof systems dealing with systems of inequalities: Positivstellensatz refutations and Positivstellensatz calculus. For both systems we prove the lower bounds on… (More)

- Dima Grigoriev
- computational complexity
- 2012

An algorithm is designed for solving a tropical linear system with complexity polynomial in the size of the system.