?
Comparing the Computational Complexity of Monomials and Elements of Finite Abelian Groups
Moscow University Mathematics Bulletin. 2022. Vol. 77. No. 3. P. 113–119.
Kochergin V.
Abstract: The computational complexity of the element (Formula presented.) of the Abelian group (Formula presented.) (it is supposed that kii for all i) and the computational complexity of the term (Formula presented.) are compared in the paper. The computational complexity means the minimal possible number of multiplication operations, and all the results of intermediate multiplications can be used multiple times. It is established that, if (Formula presented.), then the maximal possible difference and ratio of the above values asymptotically grow for (Formula presented.) as (Formula presented.) and (Formula presented.), respectively. © 2022, Pleiades Publishing, Inc.
Dayoub A., Suleiman E., IEEE, 2026.
2026 8th International Youth Conference on Radio Electronics, Electrical and Power Engineering (REEPE)
1-3 April 2026 ...
Added: April 30, 2026
Ovcharenko M., / Series arXiv "math". 2026.
We introduce an explicit class of tempered Laurent polynomials in the sense of Villegas and Doran--Kerr in n⩽4 variables including all Landau--Ginzburg models for smooth Fano threefolds with very ample anticanonical class. We check that it contains Landau--Ginzburg models for various Fano fourfolds which are complete intersections in smooth toric varieties and Grassmannians of planes, ...
Added: April 30, 2026
М.: ООО «Геомодель Развитие», 2024.
Интелшектуальный анализ данных в нефтегазовой отрасли, Калининград, Россия, 2024, ООО «Геомодель Развитие» ...
Added: April 29, 2026
Karpova Irina Petrovna, Pattern Recognition and Image Analysis 2025 Vol. 35 No. 4 P. 1138–1144
A solution to the problem of redistributing agents between groups based on simulating a form of social parasitism in ants known as slave-making is considered. To provide a comprehensive solution, the problem is integrated with a method of orientation based on visual landmarks and a compass, including route memorization and return. The models and mechanisms ...
Added: April 29, 2026
Derkacheva A., Sakirkina M., Kraev G. et al., /. 2026.
Comprehensive data on natural hazards and their consequences are crucial for effective for risk assessment, adaptation planning, and emergency response. However, many countries face challenges with fragmented, inconsistent, and inaccessible data, particularly regarding local-scale events. To address this data gap in Russia, we developed an end-to-end processing pipeline that scrapes news from various online sources, ...
Added: April 28, 2026
Domrin V. I., Malova H. V., V. Yu. Popov et al., Cosmic Research 2026 Vol. 64 No. 2 P. 238–252
During magnetospheric perturbations a relatively thin current sheet with thickness about several
proton gyroradii forms in the Earth’s magnetotail. In a framework of the kinetic model describing current
sheet thinning in the magnetotail, the processes of its formation are investigated depending on the normal
magnetic field magnitude which affects both the current sheet structure and particle dynamics within ...
Added: April 27, 2026
Tsareva O. O., Malova H. V., V. Yu. Popov et al., Plasma Physics Reports 2026 Vol. 52 No. 2 P. 179–185
The influence of asymmetry of plasma sources on the structure and spatial localization of a superthin
current sheet (STCS) supported by demagnetized electrons is studied using a self-consistent model. The
simulation takes into account the presence of a single plasma source in the northern hemisphere, which
makes the plasma flow asymmetric. It is demonstrated that the asymmetry of ...
Added: April 27, 2026
Pochinka O., Yakovlev E., Shmukler V., Russian Journal of Nonlinear Dynamics 2026
Every discrete dynamical system (cascade) generated by a homeomorphism induces a continuous
dynamic system (flow) — a suspension. However, not every flow is equivalent to a suspension
over a cascade, a necessary and sufficient condition for this is the existence of a global
section for the flow. In the case of the existence, the flow is equivalent to ...
Added: April 24, 2026
NY: Association for Computing Machinery (ACM), 2026.
It is our great pleasure to welcome you to the 35th edition of the Web Conference to be held on June 29 – July 3, 2026, in Dubai, United Arab Emirates.
Following discussions with our partners and key stakeholders, we have taken the decision to postpone the ACM Web Conference 2026, initially planned for April 2026. ...
Added: April 23, 2026
Kazaryan M., Dunin-Barkowski P., Bychkov B. et al., Selecta Mathematica, New Series 2026 Vol. 32 Article 25
We revise the notion of the blobbed topological recursion by extending it to the setting of generalized topological recursion as well as allowing blobs which do not necessarily admit topological expansion. We show that the so-called non-perturbative differentials form a special case of this revisited version of blobbed topological recursion. Furthermore, we prove the KP ...
Added: April 23, 2026
Golota A., Известия РАН. Серия математическая 2024 Т. 88 № 5 С. 47–66
Let X be a complex projective variety. Suppose that the group of birational automorphisms of X contains finite subgroups isomorphic to (Z/NZ)^r for r fixed and N arbitrarily large. We show that r does not exceed 2dim(X). Moreover, the equality holds if and only if X is birational to an abelian variety. We also show that an analogous ...
Added: November 6, 2024
Kirill V. Kaymakov, Dmitry S. Malyshev, Optimization Letters 2024 Vol. 18 P. 1273–1283
For given edge-capacitated connected graph and two its vertices s and t, the bottleneck (or max min ) path problem is to find the maximum value of path-minimum edge capacities among all paths, connecting s and t. It can be generalized by finding the bottleneck values between s and all possible t. These problems arise ...
Added: April 18, 2024
Malyshev D., Duginov O. I., Journal of Applied and Industrial Mathematics (перевод журналов "Сибирский журнал индустриальной математики" и "Дискретный анализ и исследование операций") 2023 Vol. 17 No. 4 P. 791–801
For a given graph, the edge-coloring problem is to minimize the number of colors sufficient to color all the graph edges so that any adjacent edges receive different colors. For all classes defined by sets of forbidden subgraphs, each with 7 edges, the complexity status of this problem is known. In this paper, we obtain ...
Added: February 16, 2024
Gerasimova O., Makarov I., Severin N., IEEE Access 2023 Vol. 11 P. 88074–88086
The problem of query answering over incomplete attributed graph data is a challenging field of database management systems and artificial intelligence. When there are rules on data structure expressed in the form of the ontology, the theoretical complexity of finding exact solution satisfying ontology constraints increases. Logic-based methods use theoretical constructions to obtain efficient rewritings ...
Added: January 5, 2024
Sergei Valentinovich Fedorenko, IEEE Access 2023 Vol. 11 P. 62771–62779
The novel methods for binary discrete Fourier transform (DFT) computation over the finite field have been proposed. The methods are based on a binary trace calculation over the finite field and use the cyclotomic DFT. The direct DFT computational complexity has been reduced due to using the binary trace function over the finite field and ...
Added: July 19, 2023
Complexity function and complexity of validity of modal and superintuitionistic propositional logics
Rybakov M., Shkatov D., Journal of Logic and Computation 2023 Vol. 33 No. 7 P. 1566–1595
We consider the relationship between the algorithmic properties of the validity problem for a modal or superintuitionistic propositional logic and the size of the smallest Kripke countermodels for non-theorems of the logic. We establish the existence, for every degree of unsolvability, of a propositional logic whose validity problem belongs to the degree and whose every ...
Added: January 6, 2023
Malyshev D., Duginov O. I., Journal of Applied and Industrial Mathematics (перевод журналов "Сибирский журнал индустриальной математики" и "Дискретный анализ и исследование операций") 2022 Vol. 16 P. 276–291
The edge-coloring problem is to minimize the number of colors sufficient to color all the edges of a given graph so that any adjacent edges receive distinct colors. The complexity status of this problem is known for all the classes defined by the sets of forbidden subgraphs with 7 edges each. In this paper, we ...
Added: December 31, 2022
G. S. Dakhno, D. S. Malyshev, Journal of Applied and Industrial Mathematics (перевод журналов "Сибирский журнал индустриальной математики" и "Дискретный анализ и исследование операций") 2023 Vol. 17 No. 1 P. 25–31
A hereditary class is a set of simple graphs closed under deletion of vertices; every such class is defined by the set of its minimal forbidden induced subgraphs. If this set is finite, then the class is said to be finitely defined. The concept of a boundary class is a useful tool for the analysis ...
Added: December 6, 2022
Rybakov M., Shkatov D., Theoretical Computer Science 2022 Vol. 925 P. 45–60
We prove that branching-time temporal logics CTL and CTL* are polynomial-time embeddable into their single-variable fragments. It follows that satisfiability for CTL and CTL*, and therefore also for alternating-time temporal logics ATL and ATL*, in languages with one propositional variable is as algorithmically hard as satisfiability for the full logic: EXPTIME-complete for CTL and ATL, and 2EXPTIME-complete for CTL* and ATL*. We discuss applicability of the technique used in the proofs to other ...
Added: May 12, 2022
Malyshev D. S., Приставченко О. В., Optimization Letters 2022 Vol. 16 P. 1403–1409
The vertex 3-colourability problem is to decide whether the vertex set of a given graph
can be split into three subsets of pairwise non-adjacent vertices. This problem is known
to be NP-complete in a certain class of graphs, defined by an explicit description of
allowed 5-vertex induced subgraphs in them. In the present paper, we improve this
result by ...
Added: February 25, 2022
Rubtsov A. A., Vyalyi M., Information and Computation 2021 Vol. 281 Article 104797
We consider a computational model which is known as set automata. The set automata are one-way finite automata with additional storage-the set. There are two kinds of set automata-deterministic (DSA's) and nondeterministic (NSA's). The model was introduced by Kutrib, Malcher, Wendlandt in 2014. It was shown that DSA-recognizable languages look similar to DCFL's and NSA-recognizable ...
Added: February 2, 2022
Zakharyaschev M., Kontchakov R., Ryzhikov V. et al., The International Joint Conference on Artificial Intelligence (IJCAI), 2020.
Traditionally, description logic has focused on represent- ing and reasoning about classes rather than relations (roles), which has been justified by the deterioration of the computa- tional properties if expressive role inclusions are added. The situation is even worse in the temporalised setting, where monodicity is viewed as an almost necessary condition for decidability. We ...
Added: November 6, 2021
Zhuk D., , in: 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).: [б.и.], 2021. P. 1–7.
The Surjective Constraint Satisfaction Problem (SCSP) is the problem of deciding whether there exists a surjective assignment to a set of variables subject to some specified constraints, where a surjective assignment is an assignment containing all elements of the domain. In this paper we show that the most famous SCSP, called No-Rainbow Problem, is NP-Hard. ...
Added: September 8, 2021
Barto L., Brady Z., Bulatov M. et al., , in: 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).: [б.и.], 2021. P. 1–13.
This paper focuses on the algebraic theory underlying the study of the complexity and the algorithms for the Constraint Satisfaction Problem (CSP). We unify, simplify, and extend parts of the three approaches that have been developed to study the CSP over finite templates - absorption theory that was used to characterize CSPs solvable by local ...
Added: September 8, 2021