26 research outputs found
Computing the Boolean product of two n\times n Boolean matrices using O(n^2) mechanical operation
We study the problem of determining the Boolean product of two n\times n
Boolean matrices in an unconventional computational model allowing for
mechanical operations. We show that O(n^2) operations are sufficient to compute
the product in this model.Comment: 11 pages, 7 figure
Algebraic Methods in Computational Complexity
Computational Complexity is concerned with the resources that are required for algorithms to detect properties of combinatorial objects and structures. It has often proven true that the best way to argue about these combinatorial objects is by establishing a connection (perhaps approximate) to a more well-behaved algebraic setting. Indeed, many of the deepest and most powerful results in Computational Complexity rely on algebraic proof techniques. The Razborov-Smolensky polynomial-approximation method for proving constant-depth circuit lower bounds, the PCP characterization of NP, and the Agrawal-Kayal-Saxena polynomial-time primality test
are some of the most prominent examples. In some of the most exciting recent progress in Computational Complexity the algebraic theme still plays a central role. There have been significant recent advances in algebraic circuit lower bounds, and the so-called chasm at depth 4 suggests that the restricted models now being considered are not so far from ones that would lead to a general result. There have been similar successes concerning the related problems of polynomial identity testing and circuit reconstruction in the algebraic model (and these are tied to central questions regarding the power of randomness in computation). Also the areas of derandomization and coding theory have experimented important advances. The seminar aimed to capitalize on recent progress and bring together researchers who are using a diverse array of algebraic methods in a variety of settings. Researchers in these areas are relying on ever more sophisticated and specialized mathematics and the goal of the seminar was to play an important role in educating a diverse community about the latest new techniques
Computing zeta functions of large polynomial systems over finite fields
In this paper, we improve the algorithms of Lauder-Wan \cite{LW} and Harvey
\cite{Ha} to compute the zeta function of a system of polynomial equations
in variables over the finite field \FF_q of elements, for large.
The dependence on in the original algorithms was exponential in . Our
main result is a reduction of the exponential dependence on to a polynomial
dependence on . As an application, we speed up a doubly exponential time
algorithm from a software verification paper \cite{BJK} (on universal
equivalence of programs over finite fields) to singly exponential time. One key
new ingredient is an effective version of the classical Kronecker theorem which
(set-theoretically) reduces the number of defining equations for a "large"
polynomial system over \FF_q when is suitably large
Barriers for fast matrix multiplication from irreversibility
Determining the asymptotic algebraic complexity of matrix multiplication,
succinctly represented by the matrix multiplication exponent , is a
central problem in algebraic complexity theory. The best upper bounds on
, leading to the state-of-the-art , have been
obtained via the laser method of Strassen and its generalization by Coppersmith
and Winograd. Recent barrier results show limitations for these and related
approaches to improve the upper bound on .
We introduce a new and more general barrier, providing stronger limitations
than in previous work. Concretely, we introduce the notion of "irreversibility"
of a tensor and we prove (in some precise sense) that any approach that uses an
irreversible tensor in an intermediate step (e.g., as a starting tensor in the
laser method) cannot give . In quantitative terms, we prove that
the best upper bound achievable is lower bounded by two times the
irreversibility of the intermediate tensor. The quantum functionals and
Strassen support functionals give (so far, the best) lower bounds on
irreversibility. We provide lower bounds on the irreversibility of key
intermediate tensors, including the small and big Coppersmith--Winograd
tensors, that improve limitations shown in previous work. Finally, we discuss
barriers on the group-theoretic approach in terms of "monomial"
irreversibility
Slice Rank of Block Tensors and Irreversibility of Structure Tensors of Algebras
Determining the exponent of matrix multiplication ? is one of the central open problems in algebraic complexity theory. All approaches to design fast matrix multiplication algorithms follow the following general pattern: We start with one "efficient" tensor T of fixed size and then we use a way to get a large matrix multiplication out of a large tensor power of T. In the recent years, several so-called barrier results have been established. A barrier result shows a lower bound on the best upper bound for the exponent of matrix multiplication that can be obtained by a certain restriction starting with a certain tensor.
We prove the following barrier over C: Starting with a tensor of minimal border rank satisfying a certain genericity condition, except for the diagonal tensor, it is impossible to prove ? = 2 using arbitrary restrictions. This is astonishing since the tensors of minimal border rank look like the most natural candidates for designing fast matrix multiplication algorithms. We prove this by showing that all of these tensors are irreversible, using a structural characterisation of these tensors. To obtain our result, we relate irreversibility to asymptotic slice rank and instability of tensors and prove that the instability of block tensors can often be decided by looking only on the sizes of nonzero blocks
Matrix Multiplication via Matrix Groups
In 2003, Cohn and Umans proposed a group-theoretic approach to bounding the exponent of matrix multiplication. Previous work within this approach ruled out certain families of groups as a route to obtaining ? = 2, while other families of groups remain potentially viable. In this paper we turn our attention to matrix groups, whose usefulness within this framework was relatively unexplored.
We first show that groups of Lie type cannot prove ? = 2 within the group-theoretic approach. This is based on a representation-theoretic argument that identifies the second-smallest dimension of an irreducible representation of a group as a key parameter that determines its viability in this framework. Our proof builds on Gowers\u27 result concerning product-free sets in quasirandom groups. We then give another barrier that rules out certain natural matrix group constructions that make use of subgroups that are far from being self-normalizing.
Our barrier results leave open several natural paths to obtain ? = 2 via matrix groups. To explore these routes we propose working in the continuous setting of Lie groups, in which we develop an analogous theory. Obtaining the analogue of ? = 2 in this potentially easier setting is a key challenge that represents an intermediate goal short of actually proving ? = 2. We give two constructions in the continuous setting, each of which evades one of our two barriers