There has recently been impressive progress—after nearly 50 years of stagnation—in algorithms that find solutions for certain hard computational problems, including the famous Hamiltonian problem.

Abstract: We present a novel way to produce dense linear algebra factorization algorithms. The current state-of-the-art (SOA) dense linear algebra algorithms have a performance inefficiency, and thus ...

Abstract: We present new algebraic approaches for several wellknown combinatorial problems, including non-bipartite matching, matroid intersection, and some of their generalizations. Our work yields ...

The rigid body motion can be represented by a motor in geometric algebra, and the motor can be rewritten as a trinometric function of the screw blade. In this paper, a screw blade strapdown inertial ...

We construct Markov chain algorithms for sampling from discrete exponential families conditional on a sufficient statistic. Examples include contingency tables, logistic regression, and spectral ...

Surprise: You can answer this question with modern algebra. Most folks who have been through high school mathematics courses will have taken a class called algebra - maybe even a sequence of classes ...

Hi all! Still getting used to the graphblas bindings and writing efficient enough algorithms to contribute effectively, but I thought I'd put a placeholder issue up in case someone else already has ...

Quantum computers can do wondrous things: too bad they do not exist yet. That has not stopped physicists from devising new algorithms for the devices, which can calculate a lot faster than ordinary ...

This paper observes approaches to algebraic analysis of GOST 28147-89 encryption algorithm (also known as simply GOST), which is the basis of most secure information systems in Russia. The general ...