The learning with errors (LWE) problem has become a central building block of modern
cryptographic constructions. This work collects and presents hardness results for concrete …

Improving the efficiency of algorithms for fundamental computations can have a widespread
impact, as it can affect the overall speed of a large amount of computations. Matrix …

The complexity of matrix multiplication is measured in terms of 𝜔, the smallest real number
such that two 𝑛× 𝑛 matrices can be multiplied using 𝑂 (𝑛 𝜔+ 𝜖) field operations for all 𝜖> 0; …

Recent work has shown that attention-based language models excel at recall, the ability to
ground generations in tokens previously seen in context. However, the efficiency of attention …

Attention-free language models that combine gating and convolutions are growing in
popularity due to their efficiency and increasingly competitive performance. To better …

Tensor Attention, a multi-view attention that is able to capture high-order correlations among
multiple modalities, can overcome the representational limitations of classical matrix …

This paper presents a method to analyze the powers of a given trilinear form (a special kind
of algebraic construction also called a tensor) and obtain upper bounds on the asymptotic …

Abstract Let ℰ∕ 𝔽 q be an elliptic curve, and P a point in ℰ (𝔽 q) of prime order ℓ. Vélu's
formulæ let us compute a quotient curve ℰ′= ℰ∕⟨ P⟩ and rational maps defining a …

Semidefinite programs (SDPs) are a fundamental class of optimization problems with
important recent applications in approximation algorithms, quantum complexity, robust …

Multiplying matrices faster than coppersmith-winograd Page 1 Multiplying Matrices Faster Than
Coppersmith-Winograd [Extended Abstract] Virginia Vassilevska Williams University of …