Related papers: A fast modulo primes algorithm for searching perfe…
We present a new parallel algorithm for probabilistic graphical model optimization. The algorithm relies on data-parallel primitives (DPPs), which provide portable performance over hardware architecture. We evaluate results on CPUs and GPUs…
Here we demonstrate a sieve for analysing primes and their composites, using equivalence classes based on the modulo 6 return value as applied to the Natural numbers. Five features of this 'Hexile' sieve are reviewed. The first aspect, is…
The cutting plane approach to optimal matchings has been discussed by several authors over the past decades (e.g., Padberg and Rao '82, Grotschel and Holland '85, Lovasz and Plummer '86, Trick '87, Fischetti and Lodi '07) and its…
We consider the problem of mutually unbiased bases as a polynomial optimization problem over the reals. We heavily reduce it using known symmetries before exploring it using two methods, combining a number of optimization techniques. The…
In this paper we present a novel quantum algorithm, namely the quantum grid search algorithm, to solve a special search problem. Suppose $ k $ non-empty buckets are given, such that each bucket contains some marked and some unmarked items.…
Solving semiparametric models can be computationally challenging because the dimension of parameter space may grow large with increasing sample size. Classical Newton's method becomes quite slow and unstable with intensive calculation of…
In 2015, Abatzoglou, Silverberg, Sutherland, and Wong presented a framework for primality proving algorithms for special sequences of integers using an elliptic curve with complex multiplication. They applied their framework to obtain…
We consider a combinatorial question about searching for an unknown ideal $\mu$ within a known poset $\lambda$. Elements of $\lambda$ may be queried for membership in $\mu$, but at most $k$ positive query results are permitted. The goal is…
A cube is an 8-rep-tile: it is the union of eight smaller copies of itself. Is there a set with a hole which has this property? The computer found an interesting and complicated solution, which then could be simplified. We discuss some…
With the advent of quantum computers, many quantum computing algorithms are being developed. Solving linear systems is one of the most fundamental problems in almost all science and engineering. The Harrow-Hassidim-Lloyd algorithm, a…
Linear exact modeling is a problem coming from system identification: Given a set of observed trajectories, the goal is find a model (usually, a system of partial differential and/or difference equations) that explains the data as precisely…
Proof-Number Search is a best-first search algorithm with many successful applications, especially in game solving. As large-scale computing clusters become increasingly accessible, parallelization is a natural way to accelerate…
A fundamental model of quantum computation is the programmable quantum gate array. This is a quantum processor that is fed by a program state that induces a corresponding quantum operation on input states. While being programmable, any…
We obtain an essentially optimal estimate for the moment of order 32/3 of the exponential sum having argument $\alpha x^3+\beta x^2$. Subject to modest local solubility hypotheses, we thereby establish that pairs of diagonal Diophantine…
Formulation symmetry in mixed-integer programming (MIP) can hinder solver performance by inducing redundant search, but detecting such symmetries is also a significant computational challenge. This paper explores the potential for quantum…
The problem of finding provably maximal sets of mutually unbiased bases in $\mathbb{C}^d$, for composite dimensions $d$ which are not prime powers, remains completely open. In the first interesting case, $d=6$, Zauner predicted that there…
Conway's Fried Potato Problem seeks to determine the best way to cut a convex body in $n$ parts by $n-1$ hyperplane cuts (with the restriction that the $i$-th cut only divides in two one of the parts obtained so far), in a way as to…
In this article, we establish a class of new accelerated modulus-based iteration methods for solving the linear complementarity problem. When the system matrix is an $H_+$-matrix, we present appropriate criteria for the convergence…
Modern GPUs are equipped with tensor cores (TCs) that are commonly used for matrix multiplication in artificial intelligence workloads. However, because they have high computational throughput, they can lead to significant performance gains…
One of the most basic computational problems is the task of finding a desired item in an ordered list of N items. While the best classical algorithm for this problem uses log_2 N queries to the list, a quantum computer can solve the problem…