- Factoring and Solving Linear Partial Di erential Equations D. Grigoriev, Rennes, and F. Schwarz, Sankt Augustin
- Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates
- A Lower Bound for Randomized Algebraic Decision Dima Grigoriev \Lambda Marek Karpinski y Friedhelm Meyer auf der Heide z
- A ZeroTest and an Interpolation Algorithm for the Shifted Sparse Polynomials
- TESTING SHIFT--EQUIVALENCE OF POLYNOMIALS BY DETERMINISTIC,
- COMPLEXITY LOWER BOUNDS FOR RANDOMIZED COMPUTATION TREES
- NC solving of a system of linear ordinary differential equations in several unknowns
- Weak B ezout inequality for D-modules Dima Grigoriev
- DEVIATION THEOREMS FOR SOLUTIONS OF LINEAR ORDINARY DIFFERENTIAL EQUATIONS AND APPLICATIONS
- Computing MinimumLink Path in a Homotopy Class
- AUTHENTICATION FROM MATRIX CONJUGATION DIMA GRIGORIEV AND VLADIMIR SHPILRAIN
- KOLMOGOROFF ALGORITHMS ARE STRONGER THAN TURING MACHINES D. Yu. Grigor'ev UDC 518.5
- Exponential Lower Bounds for Depth 3 Arithmetic Circuits in Algebras of Functions
- Time hierarchies for cryptographic function inversion with advice Dima Grigoriev # Edward A. Hirsch + Konstantin Pervyshev #
- NEARLY SHARP COMPLEXITY BOUNDS FOR MULTIPROCESSOR ALGEBRAIC COMPUTATIONS
- Analogue of Newton-Puiseux series for non-holonomic D-modules and factoring
- Complexity of Irreducibility Testing for a System of Linear Ordinary Differential Equations
- Universal Stratifications and a Bertini-type Theorem Dima Grigoriev
- Linear Lower Bound on Degrees of Positivstellensatz Calculus Proofs for the
- There are no sparse NPW -hard Sets Felipe Cucker
- Computational Complexity of Sparse Rational Interpolation 1
- COMPLEXITY OF POSITIVSTELLENSATZ PROOFS FOR THE KNAPSACK
- Algebraic proof systems over formulas Dima Grigoriev a Edward A. Hirsch b;1
- Introduction A problem of testing membership to a semialgebraic set \Sigma was considered by many
- Approximation and complexity II: iterated integration
- On Computing Algebraic Functions using Logarithms and Exponentials
- SIAM J. COMPt_JT. Vol. 19, No. 6, pp. 1059-1063, December 1990
- Bounds on Numbers of Vectors of Multiplicities for Polynomials
- POLYNOMIALTIME COMPUTING OVER QUADRATIC MAPS I.
- On the power of real Turing machines over binary inputs
- An Exponential Lower Bound for Depth 3 Arithmetic Circuits
- Publickey cryptography and invariant theory Dima Grigoriev
- Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes
- Constructing doubleexponential number of vectors of multipilicities of solutions of
- An Exponential Lower Bound on the Size of Algebraic Decision Trees for MAX
- Algorithms and complexity in biological pattern formation problems D. Grigoriev 1 , S. Vakulenko 2
- Approximation and complexity: Liouvillean type theorems for linear differential equations
- Quadratic Randomized Lower Bound for the Knapsack Problem \Lambda
- Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes Sam Buss 1;2
- Instability, Evolution and Morphogenesis S. Vakulenko 1 , D. Grigoriev 2
- How to test in subexponential time whether two points can be connected by a curve in a semialgebraic set
- Computability of the Additive Complexity of Algebraic Circuits with
- Exponential Lower Bound for Static Semi-Algebraic Proofs
- A low complexity probabilistic test for integer multiplication
- 2000]Primary: 03F20; Secondary: 68Q17 COMPLEXITY OF SEMIALGEBRAIC PROOFS
- Algorithms for Computing Sparse Shifts for Multivariate Polynomials
- Randomized Complexity Lower Bound for Arrangements and Polyhedra
- Nash resolution for binomial varieties as Euclidean division. Apriori termination bound, polynomial complexity in dim 2
- Constructions in publickey cryptography over matrix Dima Grigoriev
- Randomization and the Computational Power of Analytic and Algebraic Decision Trees
- Randomized Complexity Lower Bounds D. Grigoriev 1
- DEVIATION THEOREMS FOR PFAFFIAN SIGMOIDS D. Yu. Grigoriev
- A LOWER BOUND FOR THE COMPUTATIONAL COMPLEXITY OF A SET OF DISJUNCTIVES IN A MONOTONE BASIS
- MULTIPLICATIVE CO~PLEXITY OF A PAIR OF BILINEAR FORMS AND OF THE POLYNOMIAL ~LTIPLICATION
- A. Borel, Linear Algebraic Groups [Russian translation], Mir, Moscow (1972). V. E. Voskresenskii, Algebraic Tori [in Russian], Nauka, Moscow (1966)o
- TIME COMPLEXITY OF TURING MACHINES
- TWO REDUCTIONS OF GRAPH ISOMORPHISM TO PROBLEMS ON POLYNOMIALS
- 2) ~7~(~-~ ~-),~ .=~B [if-] , then either ecision algorithm is given in [3] for ------We obtain from it and Theorem 4.2 a de-SMC "
- LOWER BOUNDS IN ALGEBRAIC COMPUTATIONAL COMPLEXITY D. Yu. Grigor'ev UDC 519.5
- THE COMPLEXITY OF THE DECISION PROBLEM FOR THE FIRST ORDER THEORY OF ALGEBRAICALLY CLOSED FIELDS
- ADVANCES IN APPLIED MATHEMATICS l&76-81 (1991) The interpolation Problem for k-Sparse Sums
- Existence of Short Proofs for Nondivisibility of Sparse Polynomials Under the Extended Riemann Hypothesis
- Authentication schemes from actions on graphs, groups, or rings
- Absolute Factoring of Non-holonomic Ideals in the Plane D. Grigoriev
- EFFECTIVE HIRONAKA RESOLUTION AND ITS COMPLEXITY EDWARD BIERSTONE, DIMA GRIGORIEV, PIERRE MILMAN, JAROSLAW WLODARCZYK
- Complexity and stable evolution of circuits S. Vakulenko1
- Complexity of solving tropical linear systems Dima Grigoriev
- CRYPTOGRAPHY WITHOUT ONE-WAY FUNCTIONS DIMA GRIGORIEV AND VLADIMIR SHPILRAIN
- Invariant-based Cryptosystems and Their Security Against Provable
- Theoretical Computer Science 19 (1982) 3967 North-Holland Publishing Company
- A Complete PublicKey Cryptosystem Dima Grigoriev 1 , Edward A. Hirsch 2 # , and Konstantin Pervyshev 3
- Complexity lower bounds for approximation algebraic computation trees
- Instability, complexity and evolution S. Vakulenko 1
- Polytime Algorithm for the Shortest Path in a Homotopy Class
- Lower Bounds on Testing Membership to a Polyhedron by
- The author would like to acknowledge the advice of A. O. Slisenko and the valuable comments of S. V. Pakhomova, whichsubstantially improved the presentation.
- COMPLEXITY LOWER BOUNDS FOR COMPUTATION TREES WITH ELEMENTARY TRANSCENDENTAL FUNCTION GATES
- Complexity of Null and Positivstellensatz Proofs
- Quantum optical device... Quantum optical device accelerating dynamic programming
- TROPICAL CRYPTOGRAPHY DIMA GRIGORIEV AND VLADIMIR SHPILRAIN
- Probabilistic communication complexity over the reals Dima Grigoriev
- Complexity of a Standard Basis of a Dmodule Alexander Chistov
- Tseitin's Tautologies and Lower Bounds for Nullstellensatz Proofs D. Grigoriev 1
- Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision
- Testing ShiftEquivalence of Polynomials Using Quantum Machines D. Grigoriev 1
- COROLLARY 2. If ~g~[m~ ....,m~] and ~(~)>0 for any ~el ~ , then $(~0>41~. Proof. The function f achieves local minima and, in particular, a global minimum at
- Computational Complexity of Sparse Real Algebraic Function Interpolation
- Complexity of Null-and Positivstellensatz Proofs
- There are no sparse NP W -hard Sets Felipe Cucker*
- Approximating shortest path for the skew lines problem
- On Computing Algebraic Functions using Logarithms and Exponentials
- Weak B'ezout inequality for D-modules Dima Grigoriev
- COMPLEXITY OF POSITIVSTELLENSATZ PROOFS FOR THE KNAPSACK
- Computing Minimum-Link Path in a Homotopy Class
- TESTING SHIFT-EQUIVALENCE OF POLYNOMIALS BY DETERMINISTIC,
- Testing Shift-Equivalence of Polynomials Using Quantum Machines D. Grigoriev1
- Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision
- Linear Lower Bound on Degrees of Positivstellensatz Calculus Proofs for the
- Public-key cryptography and invariant theory Dima Grigoriev
- COMPLEXITY LOWER BOUNDS FOR COMPUTATION TREES WITH ELEMENTARY TRANSCENDENTAL FUNCTION GATES
- Approximating shortest path for the skew lines problem
- Homomorphic public-key cryptosystems and encrypting boolean circuits
- Algorithms For Sparse Rational Interpolation Dims Yu. Grigoriev * Marek Karpinski t
- Homomorphic public-key cryptosystems over groups and rings
- Lower Bounds on Testing Membership to a Polyhedron by
- An Exponential Lower Bound for Depth 3 Arithmetic Circuits
- Exponential Lower Bounds for Depth 3 Arithmetic Circuits in Algebras of Functions
- DEVIATION THEOREMS FOR PFAFFIAN SIGMOIDS D. Yu. Grigoriev
- Polytime Algorithm for the Shortest Path in a Homotopy Class
- DEVIATION THEOREMS FOR SOLUTIONS OF LINEAR ORDINARY DIFFERENTIAL EQUATIONS AND APPLICATIONS
- ON COMPUTATIONAL POWER OF ANALYTIC AND ALGEBRAIC RANDOMIZED DECISION TREES
- COMPLEXITY LOWER BOUNDS FOR RANDOMIZED COMPUTATION TREES
- On the power of real Turing machines over binary inputs
- A Zero-Test and an Interpolation Algorithm for the Shifted Sparse Polynomials
- Quadratic Randomized Lower Bound for the Knapsack Problem
- Algebraic proof systems over formulas Dima Grigoriev a Edward A. Hirsch b,1
- Randomized Complexity Lower Bounds D. Grigoriev1
- Algorithmic aspects of genetic sequences and relative Kolmogorov complexity
- NO-LEAK AUTHENTICATION BY THE SHERLOCK HOLMES METHOD
- Exponential Complexity Lower Bounds for Depth 3 Arithmetic Circuits in Algebras of
- Complexity of gene circuits, Pfaan functions and morphogenesis problem
- A Lower Bound for Randomized Algebraic Decision Trees \Lambda
- Topological Complexity of the Range Dima Grigoriev
- Algorithms for Computing Sparse Shifts for Multivariate Polynomials
- Constructing double-exponential number of vectors of multipilicities of solutions of
- An Exponential Lower Bound on the Size of Algebraic Decision Trees for MAX
- Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes
- NEARLY SHARP COMPLEXITY BOUNDS FOR MULTIPROCESSOR ALGEBRAIC COMPUTATIONS
- Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates
- Exponential Complexity Lower Bounds for Depth 3 Arithmetic Circuits in Algebras of
- NC solving of a system of linear ordinary differential equations in several unknowns
- Bounds on Numbers of Vectors of Multiplicities for Polynomials
- A Lower Bound for Randomized Algebraic Decision Trees
- Topological Complexity of the Range Searching
- Complexity lower bounds for approximation algebraic computation trees
- Approximation and complexity: Liouvillean type theorems for linear differential equations
- Computational Complexity of Sparse Rational Interpolation1
- Homomorphic public-key cryptosystems over groups and rings
- Approximation and complexity II: iterated integration
- Introduction A problem of testing membership to a semialgebraic set was considered by *
- Randomized Complexity Lower Bound for Arrangements and Polyhedra
- Tseitin's Tautologies and Lower Bounds for Nullstellensatz Proofs D. Grigoriev1
- Computability of the Additive Complexity of Algebraic Circuits with
- CONTINUOUS HARD-TO-INVERT FUNCTIONS WITH APPLICATIONS TO BIOMETRIC AUTHENTICATION
- On a tropical dual Nullstellensatz Dima Grigoriev
- Tropical geometries and dynamics of biochemical networks. Application to hybrid
- TENSOR RANK: MATCHING POLYNOMIALS AND SCHUR DIMA GRIGORIEV, MIKHAIL MUZYCHUK, AND ILYA PONOMARENKO
