| Publication | Date of Publication | Type |
|---|
| On the generic complexity of the problem of computing the Euler function | 2024-11-29 | Paper |
| On complexity of the word problem in semigroups with homogeneous relations | 2024-11-26 | Paper |
| On complexity of solving of equations over graphs | 2024-11-26 | Paper |
| Generic polynomial algorithms for the knapsack problem in some matrix semigroups | 2024-08-14 | Paper |
| On the generic complexity of solving equations over natural numbers with addition | 2024-07-16 | Paper |
| On generic complexity of the integer factorization problem | 2024-05-02 | Paper |
| On the generic complexity of the square root modulo prime problem | 2024-05-02 | Paper |
| Generically undecidable and hard problems | 2024-05-02 | Paper |
| Generic complexity of the word problem in some semigroups | 2024-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6081726 | 2023-10-05 | Paper |
| Sum of Certainties with the Product of Reasons: Neural Network with Fuzzy Aggregators | 2023-02-06 | Paper |
| The generic complexity of the graph triangulation problem | 2023-01-19 | Paper |
| The generic complexity of the bounded problem of graphs clustering | 2023-01-19 | Paper |
| Generic complexity of the membership problem for semigroups of integer matrices | 2022-04-20 | Paper |
| Subjective trusts and prospects: some practical remarks on decision making with imperfect information | 2022-03-31 | Paper |
| THE GENERAL COMPLEXITY OF THE PROBLEM TO RECOGNIZE HAMILTONIAN PATHS | 2021-10-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4986131 | 2021-04-27 | Paper |
| ON GENERIC COMPLEXITY OF THE ISOMORPHISM PROBLEM FOR FINITE SEMIGROUPS | 2021-04-27 | Paper |
| ON GENERIC COMPLEXITY OF THE PROBLEM OF REPRESENTATION OF NATURAL NUMBERS BY SUM OF TWO SQUARES | 2021-02-17 | Paper |
| ON GENERIC NP-COMPLETENESS OF THE PROBLEM OF BOOLEAN CIRCUITS SATISFIABILITY | 2021-02-17 | Paper |
| ON COMPLEXITY OF THE SATISFIABILITY PROBLEM OF SYSTEMS OVER FINITE POSETS | 2021-02-17 | Paper |
| ON GENERIC COMPLEXITY OF THE GRAPH CLUSTERING PROBLEM | 2021-02-17 | Paper |
| RELATIVIZED GENERIC CLASSES P AND NP | 2021-02-17 | Paper |
| ON GENERIC COMPLEXITY OF THE EXISTENTIAL THEORIES | 2021-02-17 | Paper |
| ON GENERIC UNDECIDABILITY OF HILBERT’S TENTH PROBLEM FOR POLYNOMIAL TREES | 2021-02-17 | Paper |
| ON COMPLEXITY OF THE EXISTENTIAL AND UNIVERSAL THEORIES OF FINITE FIELDS | 2021-02-17 | Paper |
| ON GENERIC COMPLEXITY OF DECIDABILITY PROBLEM FOR DIOPHANTINE SYSTEMS IN THE SKOLEM’S FORM | 2021-02-16 | Paper |
| ON GENERIC NP-COMPLETENESS OF THE BOOLEAN SATISFIABILITY PROBLEM | 2021-02-16 | Paper |
| ON GENERIC COMPLEXITY OF THE PROBLEM OF FINDING ROOTS IN GROUPS OF RESIDUES | 2021-02-16 | Paper |
| ON GENERIC COMPLEXITY OF THE VALIDITY PROBLEM FOR BOOLEAN FORMULAS | 2021-02-15 | Paper |
| ON GENERIC COMPLEXITY OF THE DISCRETE LOGARITHM PROBLEM | 2021-02-15 | Paper |
| ON GENERIC COMPLEXITY OF THE QUADRATIC RESIDUOSITY PROBLEM | 2021-02-15 | Paper |
| On the generic existential theory of finite graphs | 2020-11-24 | Paper |
| Generic undecidability of universal theories | 2019-11-07 | Paper |
| Generic amplification of recursively enumerable sets | 2019-03-13 | Paper |
| A generic m-reducibility | 2018-09-06 | Paper |
| Generic Gödel's incompleteness theorem | 2018-02-06 | Paper |
| Generic hardness of the Boolean satisfiability problem | 2017-11-06 | Paper |
| Generic Kleene fixed point theorem | 2017-09-11 | Paper |
| Generic undecidability of existential theory of integer numbers ring | 2017-09-06 | Paper |
| On the generic undecidability of the halting problem for normalized Turing machines | 2017-08-15 | Paper |
| A generic relation on recursively enumerable sets | 2017-07-18 | Paper |
| Generic incompleteness of formal arithmetic | 2016-07-28 | Paper |
| Generic case complexity of the graph isomorphism problem | 2016-05-19 | Paper |
| Generic complexity of first-order theories | 2015-11-16 | Paper |
| On the generic complexity of the searching graph isomorphism problem | 2015-11-09 | Paper |
| Bipolar aggregation using the uninorms | 2015-02-03 | Paper |
| Generic complexity of the Diophantine problem | 2014-01-23 | Paper |
| Structure of Uninorms | 2012-02-17 | Paper |
| Generic complexity of Presburger arithmetic | 2010-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5502885 | 2009-01-12 | Paper |
| Generic complexity of undecidable problems | 2008-06-09 | Paper |
| Generic Complexity of Presburger Arithmetic | 2008-06-03 | Paper |
| On the strongly generic undecidability of the halting problem | 2007-06-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5476780 | 2006-07-18 | Paper |
| Relativizations of the P = NP problem over the complex number field | 2005-12-12 | Paper |
| On the P-NP problem over real matrix rings | 2004-10-27 | Paper |
| UNDERSTANDING THE MEDIAN AS A FUSION OPERATOR | 2002-02-21 | Paper |
| A note on the incompatibility of openness and associativity | 1999-06-28 | Paper |
| Noncommutative self-identity aggregation | 1999-01-05 | Paper |
| Uninorm aggregation operators | 1997-09-24 | Paper |
