Dima Yu. Grigoriev

From MaRDI portal
Person:1583885

Available identifiers

zbMath Open grigorev.dimitri-yuWikidataQ5277134 ScholiaQ5277134MaRDI QIDQ1583885

List of research outcomes

PublicationDate of PublicationType
The entropy of the radical ideal of a tropical curve2024-01-29Paper
Identifying Markov chain models from time-to-event data: an algebraic approach2023-11-06Paper
BASS: Boolean Automorphisms Signature Scheme2023-06-20Paper
Digital signature schemes using non-square matrices or scrap automorphisms2023-06-15Paper
Excitable media store and transfer complicated information via topological defect motion2022-10-28Paper
Tropical Newton-Puiseux polynomials. II2022-09-22Paper
Analyzing and forecasting financial series with singular spectral analysis2022-09-16Paper
A tropical version of Hilbert polynomial (in dimension one)2021-11-29Paper
On a tropical version of the Jacobian conjecture2021-09-29Paper
Entropy of tropical holonomic sequences2021-08-05Paper
Efficiently and effectively recognizing toricity of steady state varieties2021-06-25Paper
Complexity of deciding whether a tropical linear prevariety is a tropical variety2021-06-11Paper
Semi-algebraic proofs, IPS lower bounds, and the τ-conjecture: can a natural number be negative?2021-01-19Paper
Probabilistic solution of Yao's millionaires' problem2020-12-15Paper
A Case Study on the Parametric Occurrence of Multiple Steady States2020-09-09Paper
Tropical combinatorial Nullstellensatz and sparse polynomials2020-09-07Paper
Decomposing tropical rational functions2020-06-15Paper
Key agreement based on automaton groups2020-05-11Paper
Tropical recurrent sequences2020-02-27Paper
https://portal.mardi4nfdi.de/entity/Q52157852020-02-13Paper
Identifying the parametric occurrence of multiple steady states for some biological networks2020-01-15Paper
Tropical cryptography II: Extensions by homomorphisms2019-08-07Paper
On semiring complexity of Schur polynomials2018-12-10Paper
Upper bounds on Betti numbers of tropical prevarieties2018-11-08Paper
Tropical Newton-Puiseux polynomials2018-10-23Paper
Orthogonal tropical linear prevarieties2018-10-23Paper
A framework for unconditionally secure public-key encryption (with possible decryption errors)2018-08-17Paper
Tropical effective primary and dual Nullstellensätze2018-04-20Paper
Symbolic versus numerical computation and visualization of parameter regions for multistationarity of biological networks2018-02-23Paper
Probabilistic solution of Yao's millionaires' problem2017-11-27Paper
Tropical combinatorial Nullstellensatz and fewnomials testing2017-11-22Paper
Yao’s Millionaires’ Problem and Public-Key Encryption Without Computational Assumptions2017-09-08Paper
Bounds on the number of connected components for tropical prevarieties2017-03-23Paper
Tropical Effective Primary and Dual Nullstellens"atze2017-01-24Paper
Detection of Hopf bifurcations in chemical reaction networks using convex coordinates2016-12-05Paper
Tropical differential equations2016-11-02Paper
Linear gaps between degrees for the polynomial calculus modulo distinct primes2016-09-29Paper
Lower bounds on testing membership to a polyhedron by algebraic decision trees2016-09-01Paper
Subtraction-free complexity, cluster transformations, and spanning trees2016-03-04Paper
A geometric method for model reduction of biochemical networks with polynomial rate functions2016-02-23Paper
Complexity of tropical Schur polynomials2015-12-08Paper
Bounds on numers of vectors of multiplicities for polynomials which are easy to compute2015-11-26Paper
Polynomial Complexity Recognizing a Tropical Linear Variety2015-11-25Paper
Computing Highest-Order Divisors for a Class of Quasi-Linear Partial Differential Equations2015-11-25Paper
Analysis of Reaction Network Systems Using Tropical Geometry2015-11-25Paper
Absolute factoring of non-holonomic ideals in the plane2015-09-17Paper
Tropicalization and tropical equilibration of chemical reactions2015-09-11Paper
Generalized Loewy-decomposition of d-modules2015-07-16Paper
Complexity of tropical and MIN-plus linear prevarieties2015-07-08Paper
YAO'S MILLIONAIRES' PROBLEM AND DECOY-BASED PUBLIC KEY ENCRYPTION BY CLASSICAL PHYSICS2014-11-14Paper
Tensor rank: matching polynomials and Schur rings2014-09-04Paper
Efficient Methods to Compute Hopf Bifurcations in Chemical Reaction Networks Using Reaction Coordinates2014-07-07Paper
Polynomial Complexity of Solving Systems of Few Algebraic Equations with Small Degrees2014-07-07Paper
Computing Divisors and Common Multiples of Quasi-linear Ordinary Differential Equations2014-07-07Paper
Complexity in Tropical Algebra (Invited Talk)2014-07-07Paper
Tropical Cryptography2014-04-25Paper
Tropical Geometries and Dynamics of Biochemical Networks Application to Hybrid Cell Cycle Models2014-03-21Paper
Secrecy without one-way functions2014-01-23Paper
Nikolai Aleksandrovich Shanin (obituary)2013-12-17Paper
Secure Information Transmission Based on Physical Principles2013-06-28Paper
Complexity of solving tropical linear systems2013-04-11Paper
Nash resolution for binomial varieties as Euclidean division. A priori termination bound, polynomial complexity in essential dimension 22012-11-20Paper
Universal stratifications and a Bertini-type theorem2012-11-02Paper
Complexity of Solving Systems with Few Independent Monomials and Applications to Mass-Action Kinetics2012-09-21Paper
Continuous hard-to-invert functions and biometric authentication2012-08-28Paper
No-leak authentication by the Sherlock Holmes method2012-08-28Paper
Effective Hironaka resolution and its Complexity (with appendix on applications in positive characteristic)2012-06-14Paper
Effective Hironaka resolution and its complexity2012-04-05Paper
On a tropical dual Nullstellensatz2012-03-29Paper
Authentication schemes from actions on graphs, groups, or rings2011-09-12Paper
Complexity of quantifier elimination in the theory of ordinary differential equations2011-04-16Paper
Complexity of a standard basis of a $D$-module2011-03-02Paper
A low complexity probabilistic test for integer multiplication2010-08-03Paper
Analogue of Newton-Puiseux series for non-holonomic D-modules and factoring2010-04-13Paper
Probabilistic communication complexity over the reals2010-03-15Paper
Authentication from Matrix Conjugation2010-03-11Paper
Time hierarchies for cryptographic function inversion with advice2010-01-15Paper
A Complete Public-Key Cryptosystem2009-03-23Paper
Loewy decomposition of third-order linear aPDE's in the plane2009-01-20Paper
https://portal.mardi4nfdi.de/entity/Q35453222008-12-10Paper
Loewy and primary decompositions of \(\mathcal D\)-modules2007-09-19Paper
Complexity of Janet basis of a D-module2007-04-10Paper
Homomorphic public-key cryptosystems and encrypting Boolean circuits2006-10-25Paper
Public-key cryptography and invariant theory2006-01-03Paper
On non-Abelian homomorphic public-key cryptosystems2006-01-03Paper
Weak Bézout inequality for D-modules2005-09-02Paper
https://portal.mardi4nfdi.de/entity/Q54653622005-08-22Paper
Doubly-exponential growth of the number of vectors of multiplicities for solutions of systems of polynomial2005-08-05Paper
Polynomial-time computing over quadratic maps i: sampling in real algebraic sets2005-06-16Paper
Factoring and solving linear partial differential equations2004-11-05Paper
https://portal.mardi4nfdi.de/entity/Q47368592004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q47371622004-08-11Paper
Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44704632004-07-01Paper
https://portal.mardi4nfdi.de/entity/Q44630452004-05-27Paper
Complexity of gene circuits, Pfaffian functions and the morphogenesis problem.2004-01-28Paper
https://portal.mardi4nfdi.de/entity/Q48079642004-01-14Paper
Nikolai Aleksandrovich Shanin (on his 80th birthday)2003-08-28Paper
Biography of A. O. Slissenko2003-08-17Paper
Algebraic proof systems over formulas.2003-08-17Paper
Approximation and complexity. II: Iterated integration2003-04-02Paper
Approximation and complexity: Liouvillean-type theorems for linear differential equations on an interval2002-12-16Paper
https://portal.mardi4nfdi.de/entity/Q47791512002-11-25Paper
https://portal.mardi4nfdi.de/entity/Q45425402002-08-01Paper
https://portal.mardi4nfdi.de/entity/Q45425782002-08-01Paper
Skyrmed monopoles2002-07-17Paper
There are No Sparse NPw-Hard Sets2002-04-23Paper
Linear gaps between degrees for the polynomial calculus modulo distinct primes2002-03-24Paper
Complexity of Positivstellensatz proofs for the knapsack2002-03-13Paper
Complexity of Null- and Positivstellensatz proofs2002-03-13Paper
Testing the shift-equivalence of polynomials using quantum machines2001-11-27Paper
Algorithms for computing sparse shifts for multivariate polynomials2001-09-10Paper
Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity2001-08-20Paper
https://portal.mardi4nfdi.de/entity/Q42342312001-06-21Paper
https://portal.mardi4nfdi.de/entity/Q42324672001-05-29Paper
https://portal.mardi4nfdi.de/entity/Q45269722001-02-28Paper
Complexity lower bounds for randomized computation trees over zero characteristic fields2001-02-06Paper
https://portal.mardi4nfdi.de/entity/Q43293992001-01-01Paper
Complexity lower bounds for approximation algebraic computation trees2000-09-03Paper
Exponential lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields.2000-08-08Paper
Randomized complexity lower bound for arrangements and polyhedra2000-05-18Paper
Topological complexity of the range searching2000-05-09Paper
https://portal.mardi4nfdi.de/entity/Q42527102000-04-26Paper
https://portal.mardi4nfdi.de/entity/Q42273232000-01-12Paper
https://portal.mardi4nfdi.de/entity/Q42285171999-10-04Paper
https://portal.mardi4nfdi.de/entity/Q42373651999-09-09Paper
https://portal.mardi4nfdi.de/entity/Q42272801999-05-18Paper
An exponential lower bound on the size of algebraic decision trees for MAX1999-02-02Paper
https://portal.mardi4nfdi.de/entity/Q38424601998-11-05Paper
Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines.1998-07-22Paper
A lower bound for randomized algebraic decision trees1998-05-13Paper
Randomization and the computational power of analytic and algebraic decision trees1998-05-13Paper
Computing the Additive Complexity of Algebraic Circuits with Root Extracting1998-05-10Paper
On the Power of Real Turing Machines over Binary Inputs1997-11-10Paper
Nearly sharp complexity bounds for multiprocessor algebraic computations1997-10-13Paper
Complexity lower bounds for computation trees with elementary transcendental function gates1997-09-09Paper
https://portal.mardi4nfdi.de/entity/Q31261741997-07-06Paper
Lower bound on testing membership to a polyhedron by algebraic decision and computation trees1997-03-23Paper
NC solving of a system of linear ordinary differential equations in several unknowns1997-02-27Paper
Computability of the additive complexity of algebraic circuits with root extracting1997-02-27Paper
https://portal.mardi4nfdi.de/entity/Q48804651996-06-04Paper
On Computing Algebraic Functions Using Logarithms and Exponentials1996-03-18Paper
https://portal.mardi4nfdi.de/entity/Q43083861994-12-20Paper
https://portal.mardi4nfdi.de/entity/Q43083931994-12-20Paper
Deviation theorems for solutions of differential equations and applications to lower bounds on parallel complexity of sigmoids1994-12-19Paper
https://portal.mardi4nfdi.de/entity/Q31351911994-11-29Paper
Computational Complexity of Sparse Rational Interpolation1994-04-27Paper
https://portal.mardi4nfdi.de/entity/Q42795141994-02-17Paper
Complexity of quantifier elimination in the theory of ordinary differentially closed fields1993-09-15Paper
Complexity of factorization and GCD computation for linear ordinary differential operators1993-09-15Paper
Counting connected components of a semialgebraic set in subexponential time1993-04-01Paper
Complexity of solution of linear systems in rings of differential operators1992-09-27Paper
Complexity of testing irreducibility of a system of linear ordinary differential equations1992-09-27Paper
Finding connected components of a semialgebraic set in subexponential time1992-09-27Paper
Finding connected components of a semialgebraic set in subexponential time1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q39733381992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39803331992-06-26Paper
Complexity of computations in Commutative Division of the USSR Academy of Sciences1992-06-25Paper
The interpolation problem for \(k\)-sparse sums of eigenfunctions of operators1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q39711331992-06-25Paper
Solving Ordinary Differential Equations in Terms of Series with Real Exponents1992-06-25Paper
Solving systems of polynomial inequalities over a real closed field in subexponential time1991-01-01Paper
Complexity of deciding the first-order theory of real closed fields1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33623481991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33623491991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33640331991-01-01Paper
Complexity of factoring and calculating the GCD of linear ordinary differential operators1990-01-01Paper
Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32037271989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34737021989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34816801989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34842831989-01-01Paper
Solving systems of polynomial inequalities in subexponential time1988-01-01Paper
Complexity of deciding Tarski algebra1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34801751988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47333141988-01-01Paper
THE COMPLEXITY OF THE DECISION PROBLEM FOR THE FIRST ORDER THEORY OF ALGEBRAICALLY CLOSED FIELDS1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38200041987-01-01Paper
Factorization of polynomials over a finite field and the solution of systems of algebraic equations1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30269771986-01-01Paper
Lower bounds in algebraic computational complexity1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37467981985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37281041984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51849911984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51872641984-01-01Paper
Complexity of wild matrix problems and of isomorphism of algebras and graphs1983-01-01Paper
Additive complexity in directed computations1982-01-01Paper
Time complexity of multidimensional Turing machines1982-01-01Paper
Two reductions of graph isomorphism to problems on polynomials1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47417001982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47475091982-01-01Paper
A lower bound for the computational complexity of a set of disjunctives in a monotone basis1981-01-01Paper
Problem of path connections in graphs1981-01-01Paper
Relation between rank and multiplicative complexity of a bilinear form over a commutative Noetherian ring1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39206431981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39361941981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39369191981-01-01Paper
Kolmogoroff algorithms are stronger than Turing machines1980-01-01Paper
Application of separability and independence notions for proving lower bounds of circuit complexity1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36605271980-01-01Paper
The algebraic complexity of computing a family of bilinear forms1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38660891979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38660901979-01-01Paper
THE RANK OF A PAIR OF MATRICES AND CONVOLUTION1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38825581979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41907641979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41965461979-01-01Paper
Algebraic complexity of the computation of a pair of bilinear forms1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41624841978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41321421977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41321431977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41667441977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41095841976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41138121976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41373051974-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Dima Yu. Grigoriev