1,398 research outputs found

    On semiring complexity of Schur polynomials

    No full text
    Semiring complexity is the version of arithmetic circuit complexity that allows only two operations: addition and multiplication. We show that semiring complexity of a Schur polynomial {s_\lambda(x_1,\dots,x_k)} labeled by a partition {\lambda=(\lambda_1\ge\lambda_2\ge\cdots)} is bounded by {O(\log(\lambda_1))} provided the number of variables kk is fixed

    Monotone Projection Lower Bounds from Extended Formulation Lower Bounds

    Get PDF
    In this short note, we reduce lower bounds on monotone projections of polynomials to lower bounds on extended formulations of polytopes. Applying our reduction to the seminal extended formulation lower bounds of Fiorini, Massar, Pokutta, Tiwari, & de Wolf (STOC 2012; J. ACM, 2015) and Rothvoss (STOC 2014; J. ACM, 2017), we obtain the following interesting consequences. 1. The Hamiltonian Cycle polynomial is not a monotone subexponential-size projection of the permanent; this both rules out a natural attempt at a monotone lower bound on the Boolean permanent, and shows that the permanent is not complete for non-negative polynomials in VNPR_{{\mathbb R}} under monotone p-projections. 2. The cut polynomials and the perfect matching polynomial (or "unsigned Pfaffian") are not monotone p-projections of the permanent. The latter, over the Boolean and-or semi-ring, rules out monotone reductions in one of the natural approaches to reducing perfect matchings in general graphs to perfect matchings in bipartite graphs. As the permanent is universal for monotone formulas, these results also imply exponential lower bounds on the monotone formula size and monotone circuit size of these polynomials.Comment: Published in Theory of Computing, Volume 13 (2017), Article 18; Received: November 10, 2015, Revised: July 27, 2016, Published: December 22, 201

    Lower Bounds for Monotone Counting Circuits

    Full text link
    A {+,x}-circuit counts a given multivariate polynomial f, if its values on 0-1 inputs are the same as those of f; on other inputs the circuit may output arbitrary values. Such a circuit counts the number of monomials of f evaluated to 1 by a given 0-1 input vector (with multiplicities given by their coefficients). A circuit decides ff if it has the same 0-1 roots as f. We first show that some multilinear polynomials can be exponentially easier to count than to compute them, and can be exponentially easier to decide than to count them. Then we give general lower bounds on the size of counting circuits.Comment: 20 page

    Subtraction-free complexity, cluster transformations, and spanning trees

    No full text

    Satisfiability is quasilinear complete in NQL

    Get PDF
    Considered are the classes QL (quasilinear) and NQL (nondet quasllmear) of all those problems that can be solved by deterministic (nondetermlnlsttc, respectively) Turmg machines in time O(n(log n) ~) for some k Effloent algorithms have time bounds of th~s type, it is argued. Many of the "exhausUve search" type problems such as satlsflablhty and colorabdlty are complete in NQL with respect to reductions that take O(n(log n) k) steps This lmphes that QL = NQL iff satisfiabdlty is m QL CR CATEGORIES: 5.2

    Bounds for the 3x+1 Problem using Difference Inequalities

    Full text link
    We study difference inequality systems for the 3x+1 problem introduced by the first author in 1989. These systemes can be used to give lower bounds for the number of integers below x that contain 1 in their forward orbit under the 3x+1 map. Previous methods gave away some information in these inequalities. We give an improvement which apparantly extracts full information from the inequalities. By computer aided proof we show that at least x^{0.84} of the integers below x contain 1 in their forward orbit under the 3x+1 map.Comment: 21 pages latex, 3 figure

    On the complexity of evaluating multivariate polynomials

    Get PDF

    Scheduling periodic jobs using imprecise results

    Get PDF
    One approach to avoid timing faults in hard, real-time systems is to make available intermediate, imprecise results produced by real-time processes. When a result of the desired quality cannot be produced in time, an imprecise result of acceptable quality produced before the deadline can be used. The problem of scheduling periodic jobs to meet deadlines on a system that provides the necessary programming language primitives and run-time support for processes to return imprecise results is discussed. Since the scheduler may choose to terminate a task before it is completed, causing it to produce an acceptable but imprecise result, the amount of processor time assigned to any task in a valid schedule can be less than the amount of time required to complete the task. A meaningful formulation of the scheduling problem must take into account the overall quality of the results. Depending on the different types of undesirable effects caused by errors, jobs are classified as type N or type C. For type N jobs, the effects of errors in results produced in different periods are not cumulative. A reasonable performance measure is the average error over all jobs. Three heuristic algorithms that lead to feasible schedules with small average errors are described. For type C jobs, the undesirable effects of errors produced in different periods are cumulative. Schedulability criteria of type C jobs are discussed
    • …
    corecore