| Publication | Date of Publication | Type |
|---|
Effective resolution of singularities
Pure and Applied Mathematics Quarterly | 2026-03-30 | Paper |
Identifying Markov chain models from time-to-event data: an algebraic approach
Bulletin of Mathematical Biology | 2025-01-13 | Paper |
Tropical cryptography. III: Digital signatures
Journal of Mathematical Cryptology | 2024-11-12 | Paper |
Semialgebraic proofs, IPS lower bounds, and the \(\tau\)-conjecture: can a natural number be negative?
SIAM Journal on Computing | 2024-06-27 | Paper |
Response to stress via underlying deep gene regulation networks
Mathematical Methods in the Applied Sciences | 2024-06-07 | Paper |
The entropy of the radical ideal of a tropical curve
Advances in Applied Mathematics | 2024-01-29 | Paper |
| Identifying Markov chain models from time-to-event data: an algebraic approach | 2023-11-06 | Paper |
| BASS: Boolean Automorphisms Signature Scheme | 2023-06-20 | Paper |
| Digital signature schemes using non-square matrices or scrap automorphisms | 2023-06-15 | Paper |
Excitable media store and transfer complicated information via topological defect motion
Communications in Nonlinear Science and Numerical Simulation | 2022-10-28 | Paper |
Tropical Newton-Puiseux polynomials. II
Journal of Symbolic Computation | 2022-09-22 | Paper |
Analyzing and forecasting financial series with singular spectral analysis
Dependence Modeling | 2022-09-16 | Paper |
| A tropical version of Hilbert polynomial (in dimension one) | 2021-11-29 | Paper |
On a tropical version of the Jacobian conjecture
Journal of Symbolic Computation | 2021-09-29 | Paper |
On a tropical version of the Jacobian conjecture
Journal of Symbolic Computation | 2021-09-29 | Paper |
Entropy of tropical holonomic sequences
Journal of Symbolic Computation | 2021-08-05 | Paper |
Efficiently and effectively recognizing toricity of steady state varieties
Mathematics in Computer Science | 2021-06-25 | Paper |
Complexity of deciding whether a tropical linear prevariety is a tropical variety
Applicable Algebra in Engineering, Communication and Computing | 2021-06-11 | Paper |
Semi-algebraic proofs, IPS lower bounds, and the τ-conjecture: can a natural number be negative?
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Probabilistic solution of Yao's millionaires' problem
(available as arXiv preprint) | 2020-12-15 | Paper |
A case study on the parametric occurrence of multiple steady states
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation | 2020-09-09 | Paper |
Tropical combinatorial Nullstellensatz and sparse polynomials
Foundations of Computational Mathematics | 2020-09-07 | Paper |
Decomposing tropical rational functions
Journal of Symbolic Computation | 2020-06-15 | Paper |
Key agreement based on automaton groups
Groups - Complexity - Cryptology | 2020-05-11 | Paper |
Tropical recurrent sequences
Advances in Applied Mathematics | 2020-02-27 | Paper |
| Secure multiparty computation without one-way functions | 2020-02-13 | Paper |
Identifying the parametric occurrence of multiple steady states for some biological networks
Journal of Symbolic Computation | 2020-01-15 | Paper |
Tropical cryptography II: Extensions by homomorphisms
Communications in Algebra | 2019-08-07 | Paper |
On semiring complexity of Schur polynomials
Computational Complexity | 2018-12-10 | Paper |
On semiring complexity of Schur polynomials
Computational Complexity | 2018-12-10 | Paper |
Upper bounds on Betti numbers of tropical prevarieties
Arnold Mathematical Journal | 2018-11-08 | Paper |
| Orthogonal tropical linear prevarieties | 2018-10-23 | Paper |
Tropical Newton-Puiseux polynomials
(available as arXiv preprint) | 2018-10-23 | Paper |
| A framework for unconditionally secure public-key encryption (with possible decryption errors) | 2018-08-17 | Paper |
Tropical effective primary and dual Nullstellensätze
Discrete & Computational Geometry | 2018-04-20 | Paper |
Tropical effective primary and dual Nullstellensätze
Discrete & Computational Geometry | 2018-04-20 | Paper |
Symbolic versus numerical computation and visualization of parameter regions for multistationarity of biological networks
(available as arXiv preprint) | 2018-02-23 | Paper |
Probabilistic solution of Yao's millionaires' problem
(available as arXiv preprint) | 2017-11-27 | Paper |
| Tropical combinatorial Nullstellensatz and fewnomials testing | 2017-11-22 | Paper |
Yao's millionaires' problem and public-key encryption without computational assumptions
International Journal of Foundations of Computer Science | 2017-09-08 | Paper |
Bounds on the number of connected components for tropical prevarieties
Discrete & Computational Geometry | 2017-03-23 | Paper |
| Tropical effective primary and dual Nullstellensätze | 2017-01-24 | Paper |
Detection of Hopf bifurcations in chemical reaction networks using convex coordinates
Journal of Computational Physics | 2016-12-05 | Paper |
Tropical differential equations
Advances in Applied Mathematics | 2016-11-02 | Paper |
Linear gaps between degrees for the polynomial calculus modulo distinct primes
1345.03105 | 2016-09-29 | Paper |
Lower bounds on testing membership to a polyhedron by algebraic decision trees
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Reduction methods and chaos for quadratic systems of differential equations
Studies in Applied Mathematics | 2016-05-25 | Paper |
Subtraction-free complexity, cluster transformations, and spanning trees
Foundations of Computational Mathematics | 2016-03-04 | Paper |
A geometric method for model reduction of biochemical networks with polynomial rate functions
Bulletin of Mathematical Biology | 2016-02-23 | Paper |
Complexity of tropical Schur polynomials
Journal of Symbolic Computation | 2015-12-08 | Paper |
Bounds on numers of vectors of multiplicities for polynomials which are easy to compute
Proceedings of the 2000 international symposium on Symbolic and algebraic computation | 2015-11-26 | Paper |
Polynomial Complexity Recognizing a Tropical Linear Variety
Computer Algebra in Scientific Computing | 2015-11-25 | Paper |
Computing highest-order divisors for a class of quasi-linear partial differential equations
Computer Algebra in Scientific Computing | 2015-11-25 | Paper |
Analysis of reaction network systems using tropical geometry
Computer Algebra in Scientific Computing | 2015-11-25 | Paper |
Absolute factoring of non-holonomic ideals in the plane
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation | 2015-09-17 | Paper |
Tropicalization and tropical equilibration of chemical reactions
Contemporary Mathematics | 2015-09-11 | Paper |
Generalized Loewy-decomposition of d-modules
Proceedings of the 2005 international symposium on Symbolic and algebraic computation | 2015-07-16 | Paper |
Complexity of tropical and MIN-plus linear prevarieties
Computational Complexity | 2015-07-08 | Paper |
Yao's millionaires' problem and decoy-based public key encryption by classical physics
International Journal of Foundations of Computer Science | 2014-11-14 | Paper |
Tensor rank: matching polynomials and Schur rings
Foundations of Computational Mathematics | 2014-09-04 | Paper |
Polynomial complexity of solving systems of few algebraic equations with small degrees
Computer Algebra in Scientific Computing | 2014-07-07 | Paper |
Computing Divisors and Common Multiples of Quasi-linear Ordinary Differential Equations
Computer Algebra in Scientific Computing | 2014-07-07 | Paper |
Complexity in Tropical Algebra (Invited Talk)
Computer Algebra in Scientific Computing | 2014-07-07 | Paper |
Efficient methods to compute Hopf bifurcations in chemical reaction networks using reaction coordinates
Computer Algebra in Scientific Computing | 2014-07-07 | Paper |
Tropical Cryptography
Communications in Algebra | 2014-04-25 | Paper |
Tropical Cryptography
Communications in Algebra | 2014-04-25 | Paper |
Tropical geometries and dynamics of biochemical networks application to hybrid cell cycle models
Electronic Notes in Theoretical Computer Science | 2014-03-21 | Paper |
Secrecy without one-way functions
Groups, Complexity, Cryptology | 2014-01-23 | Paper |
Obituary: Nikolai Aleksandrovich Shanin (1919--2011)
Russian Mathematical Surveys | 2013-12-17 | Paper |
Secure information transmission based on physical principles
Unconventional Computation and Natural Computation | 2013-06-28 | Paper |
Complexity of solving tropical linear systems
Computational Complexity | 2013-04-11 | Paper |
Nash resolution for binomial varieties as Euclidean division. A priori termination bound, polynomial complexity in essential dimension 2
Advances in Mathematics | 2012-11-20 | Paper |
Universal stratifications and a Bertini-type theorem
Advances in Mathematics | 2012-11-02 | Paper |
Complexity of solving systems with few independent monomials and applications to mass-action kinetics
Computer Algebra in Scientific Computing | 2012-09-21 | Paper |
Continuous hard-to-invert functions and biometric authentication
Groups, Complexity, Cryptology | 2012-08-28 | Paper |
No-leak authentication by the Sherlock Holmes method
Groups, Complexity, Cryptology | 2012-08-28 | Paper |
| Effective Hironaka resolution and its Complexity (with appendix on applications in positive characteristic) | 2012-06-14 | Paper |
Effective Hironaka resolution and its complexity
The Asian Journal of Mathematics | 2012-04-05 | Paper |
On a tropical dual Nullstellensatz
Advances in Applied Mathematics | 2012-03-29 | Paper |
Authentication schemes from actions on graphs, groups, or rings
Annals of Pure and Applied Logic | 2011-09-12 | Paper |
Complexity of quantifier elimination in the theory of ordinary differential equations
Lecture Notes in Computer Science | 2011-04-16 | Paper |
Complexity of a standard basis of a \(D\)-module.
St. Petersburg Mathematical Journal | 2011-03-02 | Paper |
A low complexity probabilistic test for integer multiplication
Journal of Complexity | 2010-08-03 | Paper |
| Analogue of Newton-Puiseux series for non-holonomic D-modules and factoring | 2010-04-13 | Paper |
Analogue of Newton-Puiseux series for non-holonomic D-modules and factoring
(available as arXiv preprint) | 2010-04-13 | Paper |
Probabilistic communication complexity over the reals
Computational Complexity | 2010-03-15 | Paper |
Authentication from matrix conjugation
Groups - Complexity - Cryptology | 2010-03-11 | Paper |
Time hierarchies for cryptographic function inversion with advice
Journal of Mathematical Sciences (New York) | 2010-01-15 | Paper |
A Complete Public-Key Cryptosystem
Groups - Complexity - Cryptology | 2009-03-23 | Paper |
Loewy decomposition of third-order linear aPDE's in the plane
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation | 2009-01-20 | Paper |
Constructions in public-key cryptography over matrix groups
(available as arXiv preprint) | 2008-12-10 | Paper |
Loewy and primary decompositions of \(\mathcal D\)-modules
Advances in Applied Mathematics | 2007-09-19 | Paper |
| Complexity of Janet basis of a D-module | 2007-04-10 | Paper |
Homomorphic public-key cryptosystems and encrypting Boolean circuits
Applicable Algebra in Engineering, Communication and Computing | 2006-10-25 | Paper |
On non-Abelian homomorphic public-key cryptosystems
Journal of Mathematical Sciences (New York) | 2006-01-03 | Paper |
Public-key cryptography and invariant theory
Journal of Mathematical Sciences (New York) | 2006-01-03 | Paper |
Weak Bézout inequality for D-modules
Journal of Complexity | 2005-09-02 | Paper |
scientific article; zbMATH DE number 2196515 (Why is no real title available?)
(available as arXiv preprint) | 2005-08-22 | Paper |
Doubly-exponential growth of the number of vectors of multiplicities for solutions of systems of polynomial
Journal of Mathematical Sciences (New York) | 2005-08-05 | Paper |
Polynomial-time computing over quadratic maps i: sampling in real algebraic sets
Computational Complexity | 2005-06-16 | Paper |
Polynomial-time computing over quadratic maps i: sampling in real algebraic sets
Computational Complexity | 2005-06-16 | Paper |
Factoring and solving linear partial differential equations
Computing | 2004-11-05 | Paper |
| scientific article; zbMATH DE number 2086627 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2086404 (Why is no real title available?) | 2004-08-11 | Paper |
Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon
Theoretical Computer Science | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2077086 (Why is no real title available?) | 2004-07-01 | Paper |
| scientific article; zbMATH DE number 2066908 (Why is no real title available?) | 2004-05-27 | Paper |
Complexity of gene circuits, Pfaffian functions and the morphogenesis problem.
Comptes Rendus. Mathématique. Académie des Sciences, Paris | 2004-01-28 | Paper |
| scientific article; zbMATH DE number 1916823 (Why is no real title available?) | 2004-01-14 | Paper |
Nikolai Aleksandrovich Shanin (on his 80th birthday)
Russian Mathematical Surveys | 2003-08-28 | Paper |
Biography of A. O. Slissenko
Theoretical Computer Science | 2003-08-17 | Paper |
Algebraic proof systems over formulas.
Theoretical Computer Science | 2003-08-17 | Paper |
Approximation and complexity. II: Iterated integration
Foundations of Computational Mathematics | 2003-04-02 | Paper |
Approximation and complexity: Liouvillean-type theorems for linear differential equations on an interval
Foundations of Computational Mathematics | 2002-12-16 | Paper |
| scientific article; zbMATH DE number 1834655 (Why is no real title available?) | 2002-11-25 | Paper |
| scientific article; zbMATH DE number 1775446 (Why is no real title available?) | 2002-08-01 | Paper |
| scientific article; zbMATH DE number 1775407 (Why is no real title available?) | 2002-08-01 | Paper |
Skyrmed monopoles
Physics Letters B | 2002-07-17 | Paper |
There are no sparse NP\(_{w}\)-hard sets
SIAM Journal on Computing | 2002-04-23 | Paper |
Linear gaps between degrees for the polynomial calculus modulo distinct primes
Journal of Computer and System Sciences | 2002-03-24 | Paper |
Complexity of Null- and Positivstellensatz proofs
Annals of Pure and Applied Logic | 2002-03-13 | Paper |
Complexity of Positivstellensatz proofs for the knapsack
Computational Complexity | 2002-03-13 | Paper |
Testing the shift-equivalence of polynomials using quantum machines
Journal of Mathematical Sciences (New York) | 2001-11-27 | Paper |
Algorithms for computing sparse shifts for multivariate polynomials
Applicable Algebra in Engineering, Communication and Computing | 2001-09-10 | Paper |
Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity
Theoretical Computer Science | 2001-08-20 | Paper |
| scientific article; zbMATH DE number 1263351 (Why is no real title available?) | 2001-06-21 | Paper |
| scientific article; zbMATH DE number 1262422 (Why is no real title available?) | 2001-05-29 | Paper |
| scientific article; zbMATH DE number 1559524 (Why is no real title available?) | 2001-02-28 | Paper |
Complexity lower bounds for randomized computation trees over zero characteristic fields
Computational Complexity | 2001-02-06 | Paper |
| scientific article; zbMATH DE number 1736028 (Why is no real title available?) | 2001-01-01 | Paper |
Complexity lower bounds for approximation algebraic computation trees
Journal of Complexity | 2000-09-03 | Paper |
Exponential lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields.
Applicable Algebra in Engineering, Communication and Computing | 2000-08-08 | Paper |
Randomized complexity lower bound for arrangements and polyhedra
Discrete & Computational Geometry | 2000-05-18 | Paper |
Topological complexity of the range searching
Journal of Complexity | 2000-05-09 | Paper |
| scientific article; zbMATH DE number 1306858 (Why is no real title available?) | 2000-04-26 | Paper |
| scientific article; zbMATH DE number 1254274 (Why is no real title available?) | 2000-01-12 | Paper |
| scientific article; zbMATH DE number 1256781 (Why is no real title available?) | 1999-10-04 | Paper |
| scientific article; zbMATH DE number 1273635 (Why is no real title available?) | 1999-09-09 | Paper |
| scientific article; zbMATH DE number 1254239 (Why is no real title available?) | 1999-05-18 | Paper |
An exponential lower bound on the size of algebraic decision trees for MAX
Computational Complexity | 1999-02-02 | Paper |
| scientific article; zbMATH DE number 1191151 (Why is no real title available?) | 1998-11-05 | Paper |
Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines.
Theoretical Computer Science | 1998-07-22 | Paper |
A lower bound for randomized algebraic decision trees
Computational Complexity | 1998-05-13 | Paper |
Randomization and the computational power of analytic and algebraic decision trees
Computational Complexity | 1998-05-13 | Paper |
Computing the Additive Complexity of Algebraic Circuits with Root Extracting
SIAM Journal on Computing | 1998-05-10 | Paper |
On the Power of Real Turing Machines over Binary Inputs
SIAM Journal on Computing | 1997-11-10 | Paper |
Nearly sharp complexity bounds for multiprocessor algebraic computations
Journal of Complexity | 1997-10-13 | Paper |
Complexity lower bounds for computation trees with elementary transcendental function gates
Theoretical Computer Science | 1997-09-09 | Paper |
| scientific article; zbMATH DE number 994059 (Why is no real title available?) | 1997-07-06 | Paper |
Lower bound on testing membership to a polyhedron by algebraic decision and computation trees
Discrete & Computational Geometry | 1997-03-23 | Paper |
NC solving of a system of linear ordinary differential equations in several unknowns
Theoretical Computer Science | 1997-02-27 | Paper |
Computability of the additive complexity of algebraic circuits with root extracting
Theoretical Computer Science | 1997-02-27 | Paper |
| scientific article; zbMATH DE number 885012 (Why is no real title available?) | 1996-06-04 | Paper |
On Computing Algebraic Functions Using Logarithms and Exponentials
SIAM Journal on Computing | 1996-03-18 | Paper |
| scientific article; zbMATH DE number 647665 (Why is no real title available?) | 1994-12-20 | Paper |
| scientific article; zbMATH DE number 647659 (Why is no real title available?) | 1994-12-20 | Paper |
Deviation theorems for solutions of differential equations and applications to lower bounds on parallel complexity of sigmoids
Theoretical Computer Science | 1994-12-19 | Paper |
| scientific article; zbMATH DE number 421669 (Why is no real title available?) | 1994-11-29 | Paper |
Computational Complexity of Sparse Rational Interpolation
SIAM Journal on Computing | 1994-04-27 | Paper |
| scientific article; zbMATH DE number 503193 (Why is no real title available?) | 1994-02-17 | Paper |
Complexity of quantifier elimination in the theory of ordinary differentially closed fields
Journal of Soviet Mathematics | 1993-09-15 | Paper |
Complexity of factorization and GCD computation for linear ordinary differential operators
Journal of Soviet Mathematics | 1993-09-15 | Paper |
Counting connected components of a semialgebraic set in subexponential time
Computational Complexity | 1993-04-01 | Paper |
Complexity of solution of linear systems in rings of differential operators
Journal of Mathematical Sciences (New York) | 1992-09-27 | Paper |
Complexity of testing irreducibility of a system of linear ordinary differential equations
Journal of Mathematical Sciences (New York) | 1992-09-27 | Paper |
Finding connected components of a semialgebraic set in subexponential time
Applicable Algebra in Engineering, Communication and Computing | 1992-09-27 | Paper |
Finding connected components of a semialgebraic set in subexponential time
Journal of Mathematical Sciences (New York) | 1992-09-27 | Paper |
| scientific article; zbMATH DE number 21309 (Why is no real title available?) | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 16652 (Why is no real title available?) | 1992-06-26 | Paper |
Complexity of computations in Commutative Division of the USSR Academy of Sciences
Mathematical Notes | 1992-06-25 | Paper |
Solving Ordinary Differential Equations in Terms of Series with Real Exponents
Transactions of the American Mathematical Society | 1992-06-25 | Paper |
| scientific article; zbMATH DE number 8550 (Why is no real title available?) | 1992-06-25 | Paper |
The interpolation problem for \(k\)-sparse sums of eigenfunctions of operators
Advances in Applied Mathematics | 1992-06-25 | Paper |
Complexity of deciding the first-order theory of real closed fields
Journal of Soviet Mathematics | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4216963 (Why is no real title available?) | 1991-01-01 | Paper |
| Determination of the connected components of a semialgebraic set in subexponential time | 1991-01-01 | Paper |
| Complexity of irreducibility testing for a system of ordinary differential equations | 1991-01-01 | Paper |
Solving systems of polynomial inequalities over a real closed field in subexponential time
Journal of Soviet Mathematics | 1991-01-01 | Paper |
Complexity of factoring and calculating the GCD of linear ordinary differential operators
Journal of Symbolic Computation | 1990-01-01 | Paper |
Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields
SIAM Journal on Computing | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4155781 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4180354 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4152348 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4142854 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4150340 (Why is no real title available?) | 1988-01-01 | Paper |
Solving systems of polynomial inequalities in subexponential time
Journal of Symbolic Computation | 1988-01-01 | Paper |
Complexity of deciding Tarski algebra
Journal of Symbolic Computation | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4119512 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4092769 (Why is no real title available?) | 1987-01-01 | Paper |
THE COMPLEXITY OF THE DECISION PROBLEM FOR THE FIRST ORDER THEORY OF ALGEBRAICALLY CLOSED FIELDS
Mathematics of the USSR-Izvestiya | 1987-01-01 | Paper |
Factorization of polynomials over a finite field and the solution of systems of algebraic equations
Journal of Soviet Mathematics | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4014674 (Why is no real title available?) | 1986-01-01 | Paper |
Lower bounds in algebraic computational complexity
Journal of Soviet Mathematics | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3982411 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3893305 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3895043 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3959582 (Why is no real title available?) | 1984-01-01 | Paper |
Complexity of wild matrix problems and of isomorphism of algebras and graphs
Journal of Soviet Mathematics | 1983-01-01 | Paper |
Time complexity of multidimensional Turing machines
Journal of Soviet Mathematics | 1982-01-01 | Paper |
Additive complexity in directed computations
Theoretical Computer Science | 1982-01-01 | Paper |
Two reductions of graph isomorphism to problems on polynomials
Journal of Soviet Mathematics | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3795355 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3804835 (Why is no real title available?) | 1982-01-01 | Paper |
A lower bound for the computational complexity of a set of disjunctives in a monotone basis
Journal of Soviet Mathematics | 1981-01-01 | Paper |
Relation between rank and multiplicative complexity of a bilinear form over a commutative Noetherian ring
Journal of Soviet Mathematics | 1981-01-01 | Paper |
Problem of path connections in graphs
Journal of Soviet Mathematics | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3752218 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3733259 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3753119 (Why is no real title available?) | 1981-01-01 | Paper |
Application of separability and independence notions for proving lower bounds of circuit complexity
Journal of Soviet Mathematics | 1980-01-01 | Paper |
Kolmogoroff algorithms are stronger than Turing machines
Journal of Soviet Mathematics | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3812518 (Why is no real title available?) | 1980-01-01 | Paper |
The algebraic complexity of computing a family of bilinear forms
USSR Computational Mathematics and Mathematical Physics | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3687507 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3668577 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3668578 (Why is no real title available?) | 1979-01-01 | Paper |
THE RANK OF A PAIR OF MATRICES AND CONVOLUTION
Russian Mathematical Surveys | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3629144 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3636192 (Why is no real title available?) | 1979-01-01 | Paper |
Algebraic complexity of the computation of a pair of bilinear forms
Journal of Soviet Mathematics | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3592970 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3600020 (Why is no real title available?) | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3561218 (Why is no real title available?) | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3561219 (Why is no real title available?) | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3532851 (Why is no real title available?) | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3537654 (Why is no real title available?) | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3565162 (Why is no real title available?) | 1974-01-01 | Paper |
Tropical cryptography III: digital signatures
(available as arXiv preprint) | N/A | Paper |
A criterion of containment for tropical hypersurfaces
(available as arXiv preprint) | N/A | Paper |
A tropical version of Hilbert function
(available as arXiv preprint) | N/A | Paper |
Valuations, bijections, and bases
(available as arXiv preprint) | N/A | Paper |
