Parcourir par

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

Geodesic


    Parcourir par

    • Revues
    • Séminaires
    • Livres
    • Congrès
    • Sources
Diskretnaya Matematika
Tome 11 (1999)
no. 3
Précédent Suivant

Volume 11 (1999) no. 3

Sommaire


Polynomial invariants of finite groups over fields of prime characteristic
S. A. Stepanov
p. 3-14

Threshold property for systems of equations in finite fields
V. F. Kolchin
p. 15-23

On the reduction of the calculation of discrete logarithms on an elliptic curve to the calculation of discrete logarithms in a finite field
I. A. Semaev
p. 24-28

On the spectra of connected graphs
S. V. Savchenko
p. 29-47

Congruences of finite multibase universal algebras
I. G. Shaposhnikov
p. 48-62

Modeling and search complexity in multiprocessor systems
È. È. Gasanov ; E. R. Erokhina
p. 63-82

Some characteristics of two-stage designs of experiments
M. I. Tikhomirova ; V. P. Chistyakov
p. 83-90

The law of large numbers for permanents of random stochastic matrices
A. N. Timashev
p. 91-98

On the random coding method
V. A. Ivanov
p. 99-108

On some properties of three-index transportation polytopes
M. A. Kravtsov ; A. P. Krachkovskii
p. 109-125

Weakly implicative selector sets of dimension~3
A. N. Degtev ; D. I. Ivanov
p. 126-132

Parametrization of solutions of some equations of squares in a free monoid
G. S. Makanin ; T. A. Makanina
p. 133-148

On the complexity of narrow systems of Boolean functions
A. V. Chashkin
p. 149-159
  • À propos
  • Contact
  • Mentions légales
  • Politique de confidentialité