In this paper we extend the class of energy functions for which the optimal -expansion and -swap moves can be computed in polynomial time. Specifically, we introduce a class of hi...
We present a technique to recover f ∈ Q(ζp) where ζp is a primitive pth root of unity for a prime p, given its norm g = f ∗ ¯f in the totally real field Q(ζp + ζ−1 p )....
In the past, Markov Decision Processes (MDPs) have become a standard for solving problems of sequential decision under uncertainty. The usual request in this framework is the compu...
This paper proposes a novel genetic quantum algorithm (GQA) to solve geometric constraint problems. Instead of binary, numeric or symbolic representation, we introduce qubit chrom...
Abstract. In this paper we study the problem of solving hard propositional satisfiability problem (SAT) instances in a computing grid or cloud, where run times and communication b...