| Publication | Date of Publication | Type |
|---|
On polynomial equations over split octonions
Communications in Mathematics | 2026-03-02 | Paper |
On generic complexity of solving of equations in finite predicate algebraic structures
Prikladnaya Diskretnaya Matematika | 2026-02-20 | Paper |
On the generic complexity of the problem of computing the Euler function
Prikladnaya Diskretnaya Matematika | 2024-11-29 | Paper |
On complexity of the word problem in semigroups with homogeneous relations
Sibirskie Elektronnye Matematicheskie Izvestiya | 2024-11-26 | Paper |
On complexity of solving of equations over graphs
Sibirskie Elektronnye Matematicheskie Izvestiya | 2024-11-26 | Paper |
Generic polynomial algorithms for the knapsack problem in some matrix semigroups
Sibirskie Elektronnye Matematicheskie Izvestiya | 2024-08-14 | Paper |
On the generic complexity of solving equations over natural numbers with addition
Prikladnaya Diskretnaya Matematika | 2024-07-16 | Paper |
On generic complexity of the integer factorization problem
Prikladnaya Diskretnaya Matematika | 2024-05-02 | Paper |
On the generic complexity of the square root modulo prime problem
Prikladnaya Diskretnaya Matematika | 2024-05-02 | Paper |
Generically undecidable and hard problems
Prikladnaya Diskretnaya Matematika | 2024-05-02 | Paper |
Generic complexity of the word problem in some semigroups
Algebra and Logic | 2024-01-11 | Paper |
| On generic complexity of the graph clustering problem with bounded clusters | 2023-10-05 | Paper |
Sum of Certainties with the Product of Reasons: Neural Network with Fuzzy Aggregators
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems | 2023-02-06 | Paper |
The generic complexity of the graph triangulation problem
Prikladnaya Diskretnaya Matematika | 2023-01-19 | Paper |
The generic complexity of the bounded problem of graphs clustering
Prikladnaya Diskretnaya Matematika | 2023-01-19 | Paper |
Generic complexity of the membership problem for semigroups of integer matrices
Prikladnaya Diskretnaya Matematika | 2022-04-20 | Paper |
Subjective trusts and prospects: some practical remarks on decision making with imperfect information
SN Operations Research Forum | 2022-03-31 | Paper |
THE GENERAL COMPLEXITY OF THE PROBLEM TO RECOGNIZE HAMILTONIAN PATHS
Prikladnaya Diskretnaya Matematika | 2021-10-08 | Paper |
| On generic complexity of the subset sum problem for semigroups of integer matrices | 2021-04-27 | Paper |
ON GENERIC COMPLEXITY OF THE ISOMORPHISM PROBLEM FOR FINITE SEMIGROUPS
Prikladnaya Diskretnaya Matematika | 2021-04-27 | Paper |
On generic complexity of the problem of representation of natural numbers by sum of two squares
Prikladnaya Diskretnaya Matematika | 2021-02-17 | Paper |
ON GENERIC NP-COMPLETENESS OF THE PROBLEM OF BOOLEAN CIRCUITS SATISFIABILITY
Prikladnaya Diskretnaya Matematika | 2021-02-17 | Paper |
On complexity of the satisfiability problem of systems over finite posets
Prikladnaya diskretnaya matematika | 2021-02-17 | Paper |
ON GENERIC COMPLEXITY OF THE GRAPH CLUSTERING PROBLEM
Prikladnaya Diskretnaya Matematika | 2021-02-17 | Paper |
Relativized generic classes P and NP
Prikladnaya diskretnaya matematika | 2021-02-17 | Paper |
On generic complexity of the existential theories
Prikladnaya Diskretnaya Matematika | 2021-02-17 | Paper |
On generic undecidability of Hilbert's tenth problem for polynomial trees
Prikladnaya Diskretnaya Matematika | 2021-02-17 | Paper |
On complexity of the existential and universal theories of finite fields
Prikladnaya Diskretnaya Matematika | 2021-02-17 | Paper |
ON GENERIC COMPLEXITY OF DECIDABILITY PROBLEM FOR DIOPHANTINE SYSTEMS IN THE SKOLEM’S FORM
Prikladnaya diskretnaya matematika | 2021-02-16 | Paper |
ON GENERIC COMPLEXITY OF DECIDABILITY PROBLEM FOR DIOPHANTINE SYSTEMS IN THE SKOLEM’S FORM
Prikladnaya diskretnaya matematika | 2021-02-16 | Paper |
On generic NP-completeness of the Boolean satisfiability problem
Prikladnaya diskretnaya matematika | 2021-02-16 | Paper |
On generic NP-completeness of the Boolean satisfiability problem
Prikladnaya diskretnaya matematika | 2021-02-16 | Paper |
ON GENERIC COMPLEXITY OF THE PROBLEM OF FINDING ROOTS IN GROUPS OF RESIDUES
Prikladnaya diskretnaya matematika | 2021-02-16 | Paper |
ON GENERIC COMPLEXITY OF THE PROBLEM OF FINDING ROOTS IN GROUPS OF RESIDUES
Prikladnaya diskretnaya matematika | 2021-02-16 | Paper |
On generic complexity of the validity problem for Boolean formulas
Prikladnaya diskretnaya matematika | 2021-02-15 | Paper |
On generic complexity of the discrete logarithm problem
Prikladnaya diskretnaya matematika | 2021-02-15 | Paper |
On generic complexity of the discrete logarithm problem
Prikladnaya diskretnaya matematika | 2021-02-15 | Paper |
ON GENERIC COMPLEXITY OF THE QUADRATIC RESIDUOSITY PROBLEM
PRIKLADNAYa DISKRETNAYa MATEMATIKA | 2021-02-15 | Paper |
On the generic existential theory of finite graphs
Sibirskie Elektronnye Matematicheskie Izvestiya | 2020-11-24 | Paper |
Generic undecidability of universal theories
Sibirskie Elektronnye Matematicheskie Izvestiya | 2019-11-07 | Paper |
Generic amplification of recursively enumerable sets
Algebra and Logic | 2019-03-13 | Paper |
| A generic m-reducibility | 2018-09-06 | Paper |
Generic Gödel's incompleteness theorem
Algebra and Logic | 2018-02-06 | Paper |
Generic hardness of the Boolean satisfiability problem
Groups - Complexity - Cryptology | 2017-11-06 | Paper |
Generic Kleene fixed point theorem
Sibirskie Elektronnye Matematicheskie Izvestiya | 2017-09-11 | Paper |
Generic undecidability of existential theory of integer numbers ring
Sibirskie Elektronnye Matematicheskie Izvestiya | 2017-09-06 | Paper |
On the generic undecidability of the halting problem for normalized Turing machines
Theory of Computing Systems | 2017-08-15 | Paper |
A generic relation on recursively enumerable sets
Algebra and Logic | 2017-07-18 | Paper |
Generic incompleteness of formal arithmetic
Sibirskie Elektronnye Matematicheskie Izvestiya | 2016-07-28 | Paper |
Generic case complexity of the graph isomorphism problem
Groups - Complexity - Cryptology | 2016-05-19 | Paper |
Generic complexity of first-order theories
Sibirskie Elektronnye Matematicheskie Izvestiya | 2015-11-16 | Paper |
On the generic complexity of the searching graph isomorphism problem
Groups - Complexity - Cryptology | 2015-11-09 | Paper |
Bipolar aggregation using the uninorms
Fuzzy Optimization and Decision Making | 2015-02-03 | Paper |
Generic complexity of the Diophantine problem
Groups, Complexity, Cryptology | 2014-01-23 | Paper |
Structure of uninorms
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems | 2012-02-17 | Paper |
Generic complexity of Presburger arithmetic
Theory of Computing Systems | 2010-03-05 | Paper |
| Granular entropy and granulation process | 2009-01-12 | Paper |
Generic complexity of undecidable problems
Journal of Symbolic Logic | 2008-06-09 | Paper |
Generic Complexity of Presburger Arithmetic
Computer Science – Theory and Applications | 2008-06-03 | Paper |
On the strongly generic undecidability of the halting problem
Theoretical Computer Science | 2007-06-06 | Paper |
| Computational complexity in algebraic systems | 2006-07-18 | Paper |
| Computational complexity in algebraic systems | 2006-07-18 | Paper |
Relativizations of the P = NP problem over the complex number field
Sibirskie Elektronnye Matematicheskie Izvestiya | 2005-12-12 | Paper |
On the P-NP problem over real matrix rings
Theoretical Computer Science | 2004-10-27 | Paper |
UNDERSTANDING THE MEDIAN AS A FUSION OPERATOR
International Journal of General Systems | 2002-02-21 | Paper |
A note on the incompatibility of openness and associativity
Fuzzy Sets and Systems | 1999-06-28 | Paper |
Noncommutative self-identity aggregation
Fuzzy Sets and Systems | 1999-01-05 | Paper |
Uninorm aggregation operators
Fuzzy Sets and Systems | 1997-09-24 | Paper |
