Geodesic

Volume 20 (2008) no. 2

Sommaire

The relationship between the level of affinity and cryptographic parameters of Boolean functions
p. 3-14
Testing numbers of the form $N=2kp_1^{m_1}p_2^{m_2}\cdots p_n^{m_n}-1$ for primality
p. 15-24
Theorems on the nonexistence of consistent sequences of criteria in some discrete problems
p. 25-31
On approximation with given accuracy of functions of $k$-valued logic by polynomials
p. 32-45
On the complexity of decoding Boolean cube splitting into cube faces
p. 46-62
Malcev rings
p. 63-81
On the complexity of construction of complete and complete bipartite graphs
p. 82-99
Minimality and deadlockness of multitape automata
p. 100-121
Parallel embeddings of octahedral polyhedra
p. 122-159