1,325 research outputs found

    The complexity of linear problems in fields

    Get PDF
    We consider linear problems in fields, ordered fields, discretely valued fields (with finite residue field or residue field of characteristic zero) and fields with finitely many independent orderings and discrete valuations. Most of the fields considered will be of characteristic zero. Formally, linear statements about these structures (with parameters) are given by formulas of the respective first-order language, in which all bound variables occur only linearly. We study symbolic algorithms (linear elimination procedures) that reduce linear formulas to linear formulas of a very simple form, i.e. quantifier-free linear formulas, and algorithms (linear decision procedures) that decide whether a given linear sentence holds in all structures of the given class. For all classes of fields considered, we find linear elimination procedures that run in double exponential space and time. As a consequence, we can show that for fields (with one or several discrete valuations), linear statements can be transferred from characteristic zero to prime characteristic p, provided p is double exponential in the length of the statement. (For similar bounds in the non-linear case, see Brown, 1978.) We find corresponding linear decision procedures in the Berman complexity classes ∪c∈NSTA(*,2cn,dn) for d = 1, 2. In particular, all hese procedures run in exponential space. The technique employed is quantifier elimination via Skolem terms based on Ferrante & Rackoff (1975). Using ideas of Fischer & Rabin (1974), Berman (1977), Fürer (1982), we establish lower bounds for these problems showing that our upper bounds are essentially tight. For linear formulas with a bounded number of quantifiers all our algorithms run in polynomial time. For linear formulas of bounded quantifier alternation most of the algorithms run in time 2O(nk) for fixed k

    Adapting Real Quantifier Elimination Methods for Conflict Set Computation

    Get PDF
    The satisfiability problem in real closed fields is decidable. In the context of satisfiability modulo theories, the problem restricted to conjunctive sets of literals, that is, sets of polynomial constraints, is of particular importance. One of the central problems is the computation of good explanations of the unsatisfiability of such sets, i.e.\ obtaining a small subset of the input constraints whose conjunction is already unsatisfiable. We adapt two commonly used real quantifier elimination methods, cylindrical algebraic decomposition and virtual substitution, to provide such conflict sets and demonstrate the performance of our method in practice

    A Survey of Satisfiability Modulo Theory

    Full text link
    Satisfiability modulo theory (SMT) consists in testing the satisfiability of first-order formulas over linear integer or real arithmetic, or other theories. In this survey, we explain the combination of propositional satisfiability and decision procedures for conjunctions known as DPLL(T), and the alternative "natural domain" approaches. We also cover quantifiers, Craig interpolants, polynomial arithmetic, and how SMT solvers are used in automated software analysis.Comment: Computer Algebra in Scientific Computing, Sep 2016, Bucharest, Romania. 201

    Subclasses of Presburger Arithmetic and the Weak EXP Hierarchy

    Full text link
    It is shown that for any fixed i>0i>0, the Σi+1\Sigma_{i+1}-fragment of Presburger arithmetic, i.e., its restriction to i+1i+1 quantifier alternations beginning with an existential quantifier, is complete for ΣiEXP\mathsf{\Sigma}^{\mathsf{EXP}}_{i}, the ii-th level of the weak EXP hierarchy, an analogue to the polynomial-time hierarchy residing between NEXP\mathsf{NEXP} and EXPSPACE\mathsf{EXPSPACE}. This result completes the computational complexity landscape for Presburger arithmetic, a line of research which dates back to the seminal work by Fischer & Rabin in 1974. Moreover, we apply some of the techniques developed in the proof of the lower bound in order to establish bounds on sets of naturals definable in the Σ1\Sigma_1-fragment of Presburger arithmetic: given a Σ1\Sigma_1-formula Φ(x)\Phi(x), it is shown that the set of non-negative solutions is an ultimately periodic set whose period is at most doubly-exponential and that this bound is tight.Comment: 10 pages, 2 figure

    A complex analogue of Toda's Theorem

    Full text link
    Toda \cite{Toda} proved in 1989 that the (discrete) polynomial time hierarchy, PH\mathbf{PH}, is contained in the class \mathbf{P}^{#\mathbf{P}}, namely the class of languages that can be decided by a Turing machine in polynomial time given access to an oracle with the power to compute a function in the counting complexity class #\mathbf{P}. This result, which illustrates the power of counting is considered to be a seminal result in computational complexity theory. An analogous result (with a compactness hypothesis) in the complexity theory over the reals (in the sense of Blum-Shub-Smale real machines \cite{BSS89}) was proved in \cite{BZ09}. Unlike Toda's proof in the discrete case, which relied on sophisticated combinatorial arguments, the proof in \cite{BZ09} is topological in nature in which the properties of the topological join is used in a fundamental way. However, the constructions used in \cite{BZ09} were semi-algebraic -- they used real inequalities in an essential way and as such do not extend to the complex case. In this paper, we extend the techniques developed in \cite{BZ09} to the complex projective case. A key role is played by the complex join of quasi-projective complex varieties. As a consequence we obtain a complex analogue of Toda's theorem. The results contained in this paper, taken together with those contained in \cite{BZ09}, illustrate the central role of the Poincar\'e polynomial in algorithmic algebraic geometry, as well as, in computational complexity theory over the complex and real numbers -- namely, the ability to compute it efficiently enables one to decide in polynomial time all languages in the (compact) polynomial hierarchy over the appropriate field.Comment: 31 pages. Final version to appear in Foundations of Computational Mathematic

    An Intuitionistic Formula Hierarchy Based on High-School Identities

    Get PDF
    We revisit the notion of intuitionistic equivalence and formal proof representations by adopting the view of formulas as exponential polynomials. After observing that most of the invertible proof rules of intuitionistic (minimal) propositional sequent calculi are formula (i.e. sequent) isomorphisms corresponding to the high-school identities, we show that one can obtain a more compact variant of a proof system, consisting of non-invertible proof rules only, and where the invertible proof rules have been replaced by a formula normalisation procedure. Moreover, for certain proof systems such as the G4ip sequent calculus of Vorob'ev, Hudelmaier, and Dyckhoff, it is even possible to see all of the non-invertible proof rules as strict inequalities between exponential polynomials; a careful combinatorial treatment is given in order to establish this fact. Finally, we extend the exponential polynomial analogy to the first-order quantifiers, showing that it gives rise to an intuitionistic hierarchy of formulas, resembling the classical arithmetical hierarchy, and the first one that classifies formulas while preserving isomorphism
    • …
    corecore