Parcourir par

  • Collections
  • Sources

Geodesic


    Parcourir par

    • Collections
    • Sources
Prikladnaâ diskretnaâ matematika
Année 2023
no. 2
Précédent Suivant

Tome (2023) no. 2

Sommaire


Characterization of APN-permutations in terms of Hamming distance between subgroups of symmetric group
A. R. Belov
p. 5-12

Properties of exponential transformations of finite field
A. A. Gruba
p. 13-29

The number of occurrences of elements from a given subset on the complication segments of linear recurrence sequences
A. S. Tissin
p. 30-39

Ways to improve the performance of zero-knowledge succinct non-interactivearguments of knowledge and the analysis of the rusults achieved
I. V. Martynenkov
p. 40-58

On additive differential probabilities of a composition of bitwise XORs
I. A. Sutormin ; N. A. Kolomeets
p. 59-75

On the complexity of graph clustering in the problem with bounded cluster sizes
R. V. Baldzhanova ; A. V. Ilev ; V. P. Il'ev
p. 76-84

Finding a family of simple circuits in graphs with vertex semidegrees bounded by $k$
A. A. Medvedev
p. 85-94

Synthesis of combinational circuits by means of bi-decomposition of Boolean functions
Yu. V. Pottosin
p. 95-105

On the solution of a general algebraic equation by power series and applications in the theory of formal grammars
O. I. Egorushkin ; I. V. Kolbasina ; K. V. Safonov
p. 106-113

On generic complexity of the graph clustering problem with bounded clusters
A. N. Rybalov
p. 114-119

Solving of the maxisum location problem on network with a restriction on transport costs
G. G. Zabudsky
p. 120-127
  • À propos
  • Contact
  • Mentions légales
  • Politique de confidentialité