The following pages link to Dima Yu. Grigoriev (Q1583885):
Displaying 50 items.
- Biography of A. O. Slissenko (Q1401345) (← links)
- Algebraic proof systems over formulas. (Q1401356) (← links)
- Complexity of gene circuits, Pfaffian functions and the morphogenesis problem. (Q1420170) (← links)
- Exponential lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields. (Q1573765) (← links)
- Complexity lower bounds for approximation algebraic computation trees (Q1578509) (← links)
- Algorithms for computing sparse shifts for multivariate polynomials (Q1583886) (← links)
- Complexity lower bounds for randomized computation trees over zero characteristic fields (Q1587344) (← links)
- Skyrmed monopoles (Q1605531) (← links)
- Upper bounds on Betti numbers of tropical prevarieties (Q1617464) (← links)
- On semiring complexity of Schur polynomials (Q1630378) (← links)
- A framework for unconditionally secure public-key encryption (with possible decryption errors) (Q1662200) (← links)
- Tropical combinatorial Nullstellensatz and fewnomials testing (Q1679981) (← links)
- Symbolic versus numerical computation and visualization of parameter regions for multistationarity of biological networks (Q1701474) (← links)
- Tropical effective primary and dual Nullstellensätze (Q1745195) (← links)
- Nash resolution for binomial varieties as Euclidean division. A priori termination bound, polynomial complexity in essential dimension 2 (Q1759381) (← links)
- Polynomial-time computing over quadratic maps i: sampling in real algebraic sets (Q1781114) (← links)
- Tropical Newton-Puiseux polynomials (Q1798320) (← links)
- Orthogonal tropical linear prevarieties (Q1798321) (← links)
- The interpolation problem for \(k\)-sparse sums of eigenfunctions of operators (Q1814141) (← links)
- Complexity of ''wild'' matrix problems and of isomorphism of algebras and graphs (Q1838291) (← links)
- Approximation and complexity. II: Iterated integration (Q1865831) (← links)
- Factoring and solving linear partial differential equations (Q1884646) (← links)
- Complexity of solving tropical linear systems (Q1947044) (← links)
- Topological complexity of the range searching (Q1977139) (← links)
- Complexity of deciding whether a tropical linear prevariety is a tropical variety (Q2032307) (← links)
- Efficiently and effectively recognizing toricity of steady state varieties (Q2035620) (← links)
- Entropy of tropical holonomic sequences (Q2048158) (← links)
- Excitable media store and transfer complicated information via topological defect motion (Q2094460) (← links)
- Analyzing and forecasting financial series with singular spectral analysis (Q2172582) (← links)
- Key agreement based on automaton groups (Q2178747) (← links)
- Decomposing tropical rational functions (Q2188975) (← links)
- Tropical combinatorial Nullstellensatz and sparse polynomials (Q2194772) (← links)
- Probabilistic solution of Yao's millionaires' problem (Q2215918) (← links)
- Probabilistic communication complexity over the reals (Q2269005) (← links)
- Complexity of deciding the first-order theory of real closed fields (Q2277024) (← links)
- Identifying the parametric occurrence of multiple steady states for some biological networks (Q2284952) (← links)
- Tropical recurrent sequences (Q2300593) (← links)
- Complexity of tropical and MIN-plus linear prevarieties (Q2353186) (← links)
- Loewy and primary decompositions of \(\mathcal D\)-modules (Q2381830) (← links)
- Weak Bézout inequality for D-modules (Q2387420) (← links)
- Homomorphic public-key cryptosystems and encrypting Boolean circuits (Q2432559) (← links)
- Doubly-exponential growth of the number of vectors of multiplicities for solutions of systems of polynomial (Q2487389) (← links)
- Public-key cryptography and invariant theory (Q2577586) (← links)
- On non-Abelian homomorphic public-key cryptosystems (Q2577587) (← links)
- Tropical Newton-Puiseux polynomials. II (Q2674012) (← links)
- There are No Sparse NP<sub><i>w</i></sub>-Hard Sets (Q2784447) (← links)
- Lower bounds on testing membership to a polyhedron by algebraic decision trees (Q2817657) (← links)
- Nikolai Aleksandrovich Shanin (obituary) (Q2868459) (← links)
- Secrecy without one-way functions (Q2873317) (← links)
- Continuous hard-to-invert functions and biometric authentication (Q2905576) (← links)
