Валерий Георгиевич Дурнев
Research Subjects
Research Interests
Валерий Георгиевич Дурнев has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Dmitry Ju. Chalyy
P.G. Demidov Yaroslavl State University
3 shared publications - Oxana V. Zetkina
Economics and Mathematics Department, P. G. Demidov Yaroslavl’ State University, 150003 Yaroslavl’, Russia
3 shared publications - Valery Anatolievich Sokolov
Demidov Yaroslavl State University, 150003, Yaroslavl, Russia
3 shared publications - A. I. Zetkina
Demidov Yaroslavl State University, Yaroslavl, Russia
2 shared publications - D. M. Murin
Demidov Yaroslavl State University, 150003, Yaroslavl, Russia
2 shared publications A. I. Zetkina
P. G. Demidov Yaroslavl’ State University, 150003, Yaroslavl’, Russia
1 shared publication
Latest Publications
- 30 September 2025
- Published by Pleiades Publishing Ltd in Siberian Mathematical Journal
- Vol. 66 (5) , 1171-1183
Undecidable Fragments of Positive Theories of Free Semigroups
- 30 September 2025
- Published by Pleiades Publishing Ltd in Siberian Mathematical Journal
- Vol. 66 (5) , 1171-1183
Undecidable Fragments of Positive Theories of Free Semigroups
- 1 August 2023
- Published by Pleiades Publishing Ltd in Siberian Advances in Mathematics
- Vol. 33 (3) , 200-203
An Extension of a Theorem of Neumann
In the present article, we prove that every countable infinite group \(G \) is embeddable into a countable infinite simple group \(\overline {G}\) such that every equation of the form is solvable in \(\overline {G} \), where \(w \) is a nontrivial reduced group word in variables \(x_1,\dots ,x_n \) and \(g\in G \).- 1 August 2023
- Published by Pleiades Publishing Ltd in Siberian Advances in Mathematics
- Vol. 33 (3) , 200-203
An Extension of a Theorem of Neumann
In the present article, we prove that every countable infinite group \(G \) is embeddable into a countable infinite simple group \(\overline {G}\) such that every equation of the form is solvable in \(\overline {G} \), where \(w \) is a nontrivial reduced group word in variables \(x_1,\dots ,x_n \) and \(g\in G \).- 1 March 2021
- Published by Elsevier in Journal of Algebra
- Vol. 570, 452-469
Algorithmic undecidability of compatibility problem for equations in free groups: Explicit equations with one commutator-type constraint
- 1 March 2021
- Published by Elsevier in Journal of Algebra
- Vol. 570, 452-469
Algorithmic undecidability of compatibility problem for equations in free groups: Explicit equations with one commutator-type constraint
- 1 September 2020
- Published by Pleiades Publishing Ltd in Lobachevskii Journal of Mathematics
- Vol. 41 (9) , 1647-1652
On ‘‘Simple’’ Undecidable Fragments of the Positive Theory of a Free Semigroup
We prove algorithmic undecidability of ‘‘simple’’ (with respect to the quantifier-prefix and the quantifier-free part of the formulas) fragments of positive theories of finitely generated semigroups.
- 1 September 2020
- Published by Pleiades Publishing Ltd in Lobachevskii Journal of Mathematics
- Vol. 41 (9) , 1647-1652
On ‘‘Simple’’ Undecidable Fragments of the Positive Theory of a Free Semigroup
We prove algorithmic undecidability of ‘‘simple’’ (with respect to the quantifier-prefix and the quantifier-free part of the formulas) fragments of positive theories of finitely generated semigroups.
- 1 December 2019
- Published by Allerton Press in Automatic Control and Computer Sciences
- Vol. 53 (7) , 699-704
A Question-Answering System for Applicant Support Using Modern Messaging Apps
There is an increasing user interest in instant messaging applications. These applications allow us to interact with other users and include a functionalit
- 1 December 2019
- Published by Allerton Press in Automatic Control and Computer Sciences
- Vol. 53 (7) , 699-704
A Question-Answering System for Applicant Support Using Modern Messaging Apps
There is an increasing user interest in instant messaging applications. These applications allow us to interact with other users and include a functionalit
- 1 December 2018
- Published by Allerton Press in Automatic Control and Computer Sciences
- Vol. 52 (7) , 880-884
On Some Approaches to the Solution of the “Useful Proof-of-Work for Blockchains” Task
The blockchain technology is based on the “proof-of-work” principles. The essence of this principle is that some event (for example the bill-to-bill money transaction) becomes significant...
- 1 December 2018
- Published by Allerton Press in Automatic Control and Computer Sciences
- Vol. 52 (7) , 880-884
On Some Approaches to the Solution of the “Useful Proof-of-Work for Blockchains” Task
The blockchain technology is based on the “proof-of-work” principles. The essence of this principle is that some event (for example the bill-to-bill money transaction) becomes significant...
- Open Access
- 27 August 2018
- Published by P.G. Demidov Yaroslavl State University in Modeling and Analysis of Information Systems
- Vol. 25 (4) , 402-410
On Some Approaches to the Solution of the Problem «Useful Proof-of-work for Blockchains»
The blockchain technology is based on the ”Proof-of-work” principles. The essence of this principle is that some event (for example the bill-to-bill money transaction) becomes significant after the confirmation by a certain computer work. So, a demand arose for such computational problems to work on, and we will spend on it about the whole blockchain system computing capacity. Now the main kind of such a problem is a hash-puzzle – the problem to find a bit string with a hash that satisfies some conditions. The important hash-puzzle weakness is the lack of the useful application outside of the blockchain technology. In this work, we offer some approaches to ”Useful Proof-of-work for blockchains” problem, namely, consider some practical variants of the NP-complete problems that could be solved with the help of SAT or LLL-solvers as the Proof-of-Work computational problems. The use of the FPTproblems requires special study. The offered approach allows to provide the following characteristics of the proof-of-work computational problems: usefulness, problems complexity management (through the dimension change, choosing problems of certain kind, the indication of necessary solution precision), mass character. Herewith we admit that not every solved problem can be useful but we consider the opportunity to solve some practical problems with the help of the blockchain technology. Among other things it is also possible to compare the virtual crypto-currency value (through the energy costs spent) and the effective result of the practical problems solution. The most complicated points of the described approach are the realization of the events-problems (providing the computer work for these events) relations and the realization of the problems complexity analysis system. This issue should be viewed as the study program because of many technical details that must be worked out further.
- 27 August 2018
- Published by P.G. Demidov Yaroslavl State University in Modeling and Analysis of Information Systems
- Vol. 25 (4) , 402-410
Open AccessOn Some Approaches to the Solution of the Problem «Useful Proof-of-work for Blockchains»
The blockchain technology is based on the ”Proof-of-work” principles. The essence of this principle is that some event (for example the bill-to-bill money transaction) becomes significant after the confirmation by a certain computer work. So, a demand arose for such computational problems to work on, and we will spend on it about the whole blockchain system computing capacity. Now the main kind of such a problem is a hash-puzzle – the problem to find a bit string with a hash that satisfies some conditions. The important hash-puzzle weakness is the lack of the useful application outside of the blockchain technology. In this work, we offer some approaches to ”Useful Proof-of-work for blockchains” problem, namely, consider some practical variants of the NP-complete problems that could be solved with the help of SAT or LLL-solvers as the Proof-of-Work computational problems. The use of the FPTproblems requires special study. The offered approach allows to provide the following characteristics of the proof-of-work computational problems: usefulness, problems complexity management (through the dimension change, choosing problems of certain kind, the indication of necessary solution precision), mass character. Herewith we admit that not every solved problem can be useful but we consider the opportunity to solve some practical problems with the help of the blockchain technology. Among other things it is also possible to compare the virtual crypto-currency value (through the energy costs spent) and the effective result of the practical problems solution. The most complicated points of the described approach are the realization of the events-problems (providing the computer work for these events) relations and the realization of the problems complexity analysis system. This issue should be viewed as the study program because of many technical details that must be worked out further.
- 1 September 2016
- Published by Tomsk State University in PRIKLADNAYa DISKRETNAYa MATEMATIKA
- No. 33(3),p. 85-92
ABOUT THE CONP-COMPLETE “INJECTIVE KNAPSACK” PROBLEM
- 1 September 2016
- Published by Tomsk State University in PRIKLADNAYa DISKRETNAYa MATEMATIKA
- No. 33(3),p. 85-92
ABOUT THE CONP-COMPLETE “INJECTIVE KNAPSACK” PROBLEM
- 14 April 2009
- Published by Springer Nature in Journal of Mathematical Sciences
- Vol. 158 (5) , 671-676
On equations in free semigroups with certain constraints on their solutions
- 14 April 2009
- Published by Springer Nature in Journal of Mathematical Sciences
- Vol. 158 (5) , 671-676
On equations in free semigroups with certain constraints on their solutions
- 30 April 2000
- Published by Steklov Mathematical Institute in Russian Mathematical Surveys
- Vol. 55 (2) , 207-296
Decision problems for groups and semigroups
- 30 April 2000
- Published by Steklov Mathematical Institute in Russian Mathematical Surveys
- Vol. 55 (2) , 207-296
Decision problems for groups and semigroups