27 research outputs found
Lower Bounds for Multilinear Order-Restricted ABPs
Proving super-polynomial lower bounds on the size of syntactic multilinear Algebraic Branching Programs (smABPs) computing an explicit polynomial is a challenging problem in Algebraic Complexity Theory. The order in which variables in {x_1,...,x_n} appear along any source to sink path in an smABP can be viewed as a permutation in S_n. In this article, we consider the following special classes of smABPs where the order of occurrence of variables along a source to sink path is restricted:
1) Strict circular-interval ABPs: For every sub-program the index set of variables occurring in it is contained in some circular interval of {1,..., n}.
2) L-ordered ABPs: There is a set of L permutations (orders) of variables such that every source to sink path in the smABP reads variables in one of these L orders, where L 0.
We prove exponential (i.e., 2^{Omega(n^delta)}, delta>0) lower bounds on the size of above models computing an explicit multilinear 2n-variate polynomial in VP.
As a main ingredient in our lower bounds, we show that any polynomial that can be computed by an smABP of size S, can be written as a sum of O(S) many multilinear polynomials where each summand is a product of two polynomials in at most 2n/3 variables, computable by smABPs. As a corollary, we show that any size S syntactic multilinear ABP can be transformed into a size S^{O(sqrt{n})} depth four syntactic multilinear Sigma Pi Sigma Pi circuit where the bottom Sigma gates compute polynomials on at most O(sqrt{n}) variables.
Finally, we compare the above models with other standard models for computing multilinear polynomials
Undecidability of Semi-Unification on a Napkin
Semi-unification (unification combined with matching) has been proven undecidable by Kfoury, Tiuryn, and Urzyczyn in the 1990s. The original argument reduces Turing machine immortality via Turing machine boundedness to semi-unification. The latter part is technically most challenging, involving several intermediate models of computation.
This work presents a novel, simpler reduction from Turing machine boundedness to semi-unification. In contrast to the original argument, we directly translate boundedness to solutions of semi-unification and vice versa. In addition, the reduction is mechanized in the Coq proof assistant, relying on a mechanization-friendly stack machine model that corresponds to space-bounded Turing machines. Taking advantage of the simpler proof, the mechanization is comparatively short and fully constructive
Constructive Many-One Reduction from the Halting Problem to Semi-Unification
Semi-unification is the combination of first-order unification and
first-order matching. The undecidability of semi-unification has been proven by
Kfoury, Tiuryn, and Urzyczyn in the 1990s by Turing reduction from Turing
machine immortality (existence of a diverging configuration). The particular
Turing reduction is intricate, uses non-computational principles, and involves
various intermediate models of computation. The present work gives a
constructive many-one reduction from the Turing machine halting problem to
semi-unification. This establishes RE-completeness of semi-unification under
many-one reductions. Computability of the reduction function, constructivity of
the argument, and correctness of the argument is witnessed by an axiom-free
mechanization in the Coq proof assistant. Arguably, this serves as
comprehensive, precise, and surveyable evidence for the result at hand. The
mechanization is incorporated into the existing, well-maintained Coq library of
undecidability proofs. Notably, a variant of Hooper's argument for the
undecidability of Turing machine immortality is part of the mechanization.Comment: CSL 2022 - LMCS special issu
Unbalancing Sets and an Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits
We prove a lower bound of Omega(n^2/log^2 n) on the size of any syntactically multilinear arithmetic circuit computing some explicit multilinear polynomial f(x_1, ..., x_n). Our approach expands and improves upon a result of Raz, Shpilka and Yehudayoff ([Ran Raz et al., 2008]), who proved a lower bound of Omega(n^{4/3}/log^2 n) for the same polynomial. Our improvement follows from an asymptotically optimal lower bound for a generalized version of Galvin\u27s problem in extremal set theory
Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version)
Semi-unification is the combination of first-order unification and
first-order matching. The undecidability of semi-unification has been proven by
Kfoury, Tiuryn, and Urzyczyn in the 1990s by Turing reduction from Turing
machine immortality (existence of a diverging configuration). The particular
Turing reduction is intricate, uses non-computational principles, and involves
various intermediate models of computation. The present work gives a
constructive many-one reduction from the Turing machine halting problem to
semi-unification. This establishes RE-completeness of semi-unification under
many-one reductions. Computability of the reduction function, constructivity of
the argument, and correctness of the argument is witnessed by an axiom-free
mechanization in the Coq proof assistant. Arguably, this serves as
comprehensive, precise, and surveyable evidence for the result at hand. The
mechanization is incorporated into the existing, well-maintained Coq library of
undecidability proofs. Notably, a variant of Hooper's argument for the
undecidability of Turing machine immortality is part of the mechanization