The following pages link to Dima Yu. Grigoriev (Q1583885):
Displaying 50 items.
- (Q335862) (redirect page) (← links)
- Tropical differential equations (Q335863) (← links)
- Detection of Hopf bifurcations in chemical reaction networks using convex coordinates (Q349840) (← links)
- Tensor rank: matching polynomials and Schur rings (Q404298) (← links)
- On a tropical dual Nullstellensatz (Q408132) (← links)
- Effective Hironaka resolution and its complexity (Q408453) (← links)
- Bounds on the number of connected components for tropical prevarieties (Q517460) (← links)
- Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon (Q598213) (← links)
- Authentication schemes from actions on graphs, groups, or rings (Q638486) (← links)
- Lower bound on testing membership to a polyhedron by algebraic decision and computation trees (Q677021) (← links)
- Complexity of quantifier elimination in the theory of ordinary differentially closed fields (Q684955) (← links)
- Complexity of factorization and GCD computation for linear ordinary differential operators (Q684956) (← links)
- Universal stratifications and a Bertini-type theorem (Q715205) (← links)
- (Q804241) (redirect page) (← links)
- Solving systems of polynomial inequalities over a real closed field in subexponential time (Q804242) (← links)
- Complexity of factoring and calculating the GCD of linear ordinary differential operators (Q805235) (← links)
- On a tropical version of the Jacobian conjecture (Q820973) (← links)
- Time hierarchies for cryptographic function inversion with advice (Q843601) (← links)
- Complexity of tropical Schur polynomials (Q898243) (← links)
- A low complexity probabilistic test for integer multiplication (Q983183) (← links)
- Lower bounds in algebraic computational complexity (Q1057648) (← links)
- Factorization of polynomials over a finite field and the solution of systems of algebraic equations (Q1078248) (← links)
- Solving systems of polynomial inequalities in subexponential time (Q1113939) (← links)
- Kolmogoroff algorithms are stronger than Turing machines (Q1147126) (← links)
- Application of separability and independence notions for proving lower bounds of circuit complexity (Q1147680) (← links)
- A lower bound for the computational complexity of a set of disjunctives in a monotone basis (Q1147681) (← links)
- Problem of path connections in graphs (Q1147682) (← links)
- Relation between rank and multiplicative complexity of a bilinear form over a commutative Noetherian ring (Q1153191) (← links)
- Additive complexity in directed computations (Q1164996) (← links)
- Time complexity of multidimensional Turing machines (Q1168311) (← links)
- Two reductions of graph isomorphism to problems on polynomials (Q1168312) (← links)
- Complexity of computations in Commutative Division of the USSR Academy of Sciences (Q1173942) (← links)
- Complexity of solution of linear systems in rings of differential operators (Q1190952) (← links)
- Complexity of testing irreducibility of a system of linear ordinary differential equations (Q1190953) (← links)
- Counting connected components of a semialgebraic set in subexponential time (Q1207337) (← links)
- (Q1253697) (redirect page) (← links)
- Algebraic complexity of the computation of a pair of bilinear forms (Q1253698) (← links)
- Complexity of deciding Tarski algebra (Q1264143) (← links)
- An exponential lower bound on the size of algebraic decision trees for MAX (Q1277095) (← links)
- Randomized complexity lower bound for arrangements and polyhedra (Q1289238) (← links)
- (Q1338214) (redirect page) (← links)
- Deviation theorems for solutions of differential equations and applications to lower bounds on parallel complexity of sigmoids (Q1338215) (← links)
- NC solving of a system of linear ordinary differential equations in several unknowns (Q1351699) (← links)
- Computability of the additive complexity of algebraic circuits with root extracting (Q1351701) (← links)
- Testing the shift-equivalence of polynomials using quantum machines (Q1356318) (← links)
- Nearly sharp complexity bounds for multiprocessor algebraic computations (Q1361876) (← links)
- Complexity lower bounds for computation trees with elementary transcendental function gates (Q1365876) (← links)
- A lower bound for randomized algebraic decision trees (Q1386178) (← links)
- Randomization and the computational power of analytic and algebraic decision trees (Q1386179) (← links)
- Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines. (Q1390870) (← links)
