. The Circulant Travelling Salesman Problem (CTSP) is the problem of finding a minimum weight Hamiltonian cycle in a weighted graph with circulant distance matrix. The computational complexity of this...
State-of-the-art teleconference systems are not capable of recording a discussion of an entire group. The reason is that limited bandwidth of computer networks only allows for the use of cameras with ...
We systematically investigate the possible transitions between classical homogeneous Riemannian 3-hypersurfaces of cosmological models on one hand, and between homogeneous Lorentzian minisuperspace 3-...
State-of-the-art teleconference systems are not capable of recording a discussion of an entire group. The reason is that limited bandwidth of computer networks only allows for the use of cameras with ...