Geodesic

Volume 30 (2023) no. 3

Table of contents

Estimates of implementation complexity for quantum cryptanalysis of post-quantum lattice-based cryptosystems
p. 5-42
Additional constraints for dynamic competitive facility location problem
p. 43-56
On a lower bound for the number of bent functions at the minimum distance from a bent function in the Maiorana–McfFrland class
p. 57-80
Hypergraph edge representations with the use of homological paths
p. 81-95
Ptas for problems of vector choice and clustering with different centers
p. 96-110
On trees with given diameter and extremal number of distance-$k$ independent sets
p. 111-131