Geodesic

Volume 32 (2020) no. 1

Sommaire

Universal functions for linear functions depending on two variables
p. 3-7
On the dependence of the complexity and depth of reversible circuits consisting of NOT, CNOT, and 2-CNOT gates on the number of additional inputs
p. 8-26
Perfect matchings and $K_{1, p}$-restricted graphs
p. 27-50
Boolean analogues of Pascal triangle with the maximum possible number of ones
p. 51-59
On the action of the implicative closure operator on the set of partial functions of the multivalued logic
p. 60-73
On distance-regular graphs with $c_2=2$
p. 74-80
On the complexity of monotone circuits for threshold symmetric Boolean functions
p. 81-109
Reduction of the integer factorization complexity upper bound to the complexity of the Diffie--Hellman problem
p. 110-114
Classification of Hadamard productsof one-codimensional subcodesof Reed--Muller codes
p. 115-134
Large deviations of branching process in a random environment. II
p. 135-156