Related papers: Computing the Boolean product of two n\times n Boo…

Quantum computations promise the ability to solve problems intractable in the classical setting. Restricting the types of computations considered often allows to establish a provable theoretical advantage by quantum computations, and later…

We consider boolean circuits computing n-operators f:{0,1}^n --> {0,1}^n. As gates we allow arbitrary boolean functions; neither fanin nor fanout of gates is restricted. An operator is linear if it computes n linear forms, that is, computes…

The goal of this article is to study algorithms that compute the product between two matrixes, specifically using the ingenuous methods of Strassen and Strassen-Winograd, which will be presented in Section 2. At present, the cited methods…

We study the problem of multiplying two bit matrices with entries either over the Boolean algebra $(0,1,\vee,\wedge)$ or over the binary field $(0,1,+,\cdot)$. We engineer high-performance open-source algorithm implementations for…

A technique to compute arbitrary products of a class of Fibonacci $2\times2$ square matrices is proved in this work. General explicit solutions for non autonomous Fibonacci difference equations are obtained from these products. In the…

The Moyal product is used to cast the equation for the metric of a non-hermitian Hamiltonian in the form of a differential equation. For Hamiltonians of the form $p^2+V(ix)$ with $V$ polynomial this is an exact equation. Solving this…

It is widely known that the lower bound for the algorithmic complexity of square matrix multiplication resorts to at least $n^2$ arithmetic operations. The justification builds upon the following reasoning: given that there are $2 n^2$…

In this research, the Bernoulli polynomials are introduced. The properties of these polynomials are employed to construct the operational matrices of integration together with the derivative and product. These properties are then utilized…

Matrix multiplication is a fundamental task in almost all computational fields, including machine learning and optimization, computer graphics, signal processing, and graph algorithms (static and dynamic). Twin-width is a natural complexity…

Karppa & Kaski (2019) proposed a novel ``broken" or ``opportunistic" matrix multiplication algorithm, based on a variant of Strassen's algorithm, and used this to develop new algorithms for Boolean matrix multiplication, among other tasks.…

We present new algorithms to compute fundamental properties of a Boolean function given in truth-table form. Specifically, we give an O(N^2.322 log N) algorithm for block sensitivity, an O(N^1.585 log N) algorithm for `tree decomposition,'…

Let $A$ and $B$ be two -non necessarily bounded- normal operators. We give new conditions making their product normal. We also generalize a result by Deutsch et al on normal products of matrices.

Recently, Bapat and Kurata [\textit{Linear Algebra Appl.}, 562(2019), 135-153] defined the Cartesian product of two square matrices $A$ and $B$ as $A\oslash B=A\otimes \J+\J\otimes B$, where $\J$ is the all one matrix of appropriate order…

We introduce a simple algorithm that efficiently computes tensor products of Pauli matrices. This is done by tailoring the calculations to this specific case, which allows to avoid unnecessary calculations. The strength of this strategy is…

We introduce a n-term quadrature to integrate inner products of n functions, as opposed to a Gaussian quadrature to integrate 2n functions. We will characterize and provide computational tools to construct the inner product quadrature, and…

We propose a non-commutative algorithm for multiplying 2x2 matrices using 7 coefficient products. This algorithm reaches simultaneously a better accuracy in practice compared to previously known such fast algorithms, and a time complexity…

We present an algorithm that computes the product of two n-bit integers in O(n log n (4\sqrt 2)^{log^* n}) bit operations. Previously, the best known bound was O(n log n 6^{log^* n}). We also prove that for a fixed prime p, polynomials in…

Consider the problem of estimating the median of N items to a precision epsilon, i.e., the estimate should be such that, with a high probability, the number of items, with values both smaller than and larger than this estimate, is less than…

The classical division algorithm for polynomials requires $O(n^2)$ operations for inputs of size $n$. Using reversal technique and Newton iteration, it can be improved to $O({M}(n))$, where ${M}$ is a multiplication time. But the method…

In this paper, we show that the time complexity of monotone min-plus product of two $n\times n$ matrices is $\tilde{O}(n^{(3+\omega)/2})=\tilde{O}(n^{2.687})$, where $\omega < 2.373$ is the fast matrix multiplication exponent [Alman and…