An important part of the computer science is focused on the links that can be established between group theory and graph theory. Cayley graphs can establish such a link but meet so...
: Taking as a starting point (a modification of) a weak theory of arithmetic of Jan Johannsen and Chris Pollett (connected with the hierarchy of counting functions), we introduce s...
We present a randomised polynomial time algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space. The proof of correctness of the algorithm relie...
Algorithmic meta theorems are algorithmic results that apply to whole families of combinatorial problems, instead of just specific problems. These families are usually defined i...
Abstract. In this paper, a general framework of quantum-inspired multiobjective evolutionary algorithms is proposed based on the basic principles of quantum computing and general s...