Parcourir par

  • Revues
  • Séminaires
  • Livres
  • Congrès
  • Sources

Geodesic


    Parcourir par

    • Revues
    • Séminaires
    • Livres
    • Congrès
    • Sources
Prikladnaâ diskretnaâ matematika
Année 2024
no. 2
Précédent Suivant

Volume (2024) no. 2

Sommaire


To the 85th anniversary of Gennady Petrovich Agibalov
p. 5-6

Criterion for equational Noetherianity and complexity of the solvability problem for systems of equations over partially ordered sets
A. Yu. Nikitin ; N. D. Kudyk
p. 7-19

Comparison of outerplanarity and~generalized~outerplanarity properties for~Cayley~graphs~of~planar~semigroups
D. V. Solomatin
p. 20-26

Streebog as a random oracle
L. R. Akhmetzyanova ; A. A. Babueva ; A. A. Bozhko
p. 27-42

Graph methods for recognition of CMOS gates in transistor-level circuits
D. I. Cheremisinov ; L. D. Cheremisinova
p. 43-55

Database analysis of optimal double-loop networks
E. A. Monakhova ; O. G. Monakhov
p. 56-71

On the generic complexity of solving equations over~natural numbers with addition
A. N. Rybalov
p. 72-78

Simplified formula for summing discrete values of~some~functions
V. R. Osipov
p. 79-98

Makespan minimization in reentrant flow shop problem with identical jobs
A. A. Romanova ; V. V. Servakh ; V. Yu. Tavchenko
p. 99-111

Approach to analysis and construction of algorithms for solving one clustering problem on signed graphs
A. A. Soldatenko ; D. V. Semenova ; E. I. Ibragimova
p. 112-127
  • À propos
  • Contact
  • Mentions légales
  • Politique de confidentialité