Find out how to access previewonly content
Date:
31 May 2005
A constantspace sequential model of computation for firstorder logic
 Steven Lindell
 … show all 1 hide
Abstract
We define and justify a natural sequential model of computation with a constant amount of read/write work space, despite unlimited (polynomial) access to readonly input and writeonly output. The model is both deterministic, uniform, and sequential. The constant work space is modeled by a finite number of destructive read boolean variables, assignable by formulas over the canonical boolean operations. We then show that computation on this model is equivalent to expressibility in firstorder logic, giving a duality between (readonce) constantspace serial algorithms and constanttime parallel algorithms.
Partially supported by NSF grant CCR9403447, and the John C. Whitehead faculty research fund at Haverford College.
 E. Allender, Balcázar, N.. Immerman “A FirstOrder Isomorphism Theorem” to appear in SIAM Journal on Computing. A preliminary version appeared in Proc. 10th Symposium on Theoretical Aspects of Computer Science, SpringerVerlag LNCS 665, pp. 163–174, 1993.
 E. Allender, V. Gore “Rudimentary reductions revisited” Information Processing Letters 40 89–95 (1991). CrossRef
 S. Buss, “Algorithms for Boolean Formula Evaluation and for Tree Contraction” in Arithmetic, Proof Theory, and Computational Complexity, editors: Peter Clote and Jan Krajícěk, Oxford University Press, pp.95–115, 1993.
 D. Mix Barrington, K. Compton, H. Straubing, D. Thérien “Regular Languages in NC ^{1}” JCSS, June 1992 pp. 478–499.
 D. Mix Barrington, N. Immerman “Time, Hardware, and Uniformity” IEEE Structures, 1994 pp.176–185.
 D. Mix Barrington, N. Immerman, H. Straubing “On Uniformity in NC ^{1}” JCSS 41, pp.274–306 (1990).
 P. Clote “Sequential, machineindependent characterizations of the parallel complexity classes AlogTIME, AC ^{k}, NC ^{k} and NC.” in Feasible Mathematics, S. Buss and P. Scott editors, Birkhäuser 1990.
 E. Dahlhaus, “Reduction to NPcomplete problems by interpretations” LNCS 171, SpringerVerlag, pp.357–365, 1984.
 A. Dawar “Generalized Quantifiers and Logical Reducibilities” Journal of Logic and Computation, Vol 5, No. 2, pp. 213–226, 1995.
 H. Enderton, A Mathematical Introduction to Logic, Academic Press, 1972.
 M. Furst, J.B. Saxe, M. Sipser “Parity, Circuits, and the Polynomialtime Hierarchy” Math. Syst. Theory 17, pp. 13–27, 1984.
 Y. Gurevich “Logic and the Challenge of Computer Science” in Trends in Theoretical Computer Science, Editor: Egon Börger, Computer Science Press, 1988, pp.1–57.
 J. W. Hong Computation: Computability, Similarity, and Duality Wiley 1986.
 N. Immerman, “Expressibility and Parallel Complexity” SIAM Journal of Computing vol. 18 no. 3, June 1989, pp. 625–638.
 N. Immerman, S. Landau “The Complexity of Iterated Multiplication” Information and Computation 116(1):103–116, January 1995.
 S. Istrail, D. Zivkovic “Boundedwidth polynomialsize Boolean formulas compute exactly those functions in AC ^{O}” Information Processing Letters 50, pp.211–216, 1994.
 S. Lindell, The Logical Complexity of Queries on Unordered Graphs, Ph.D. Dissertation, UCLA 1987.
 S. Lindell, “A Purely Logical Characterization of Circuit Uniformity” IEEE Structure in Complexity Theory (1992) pp.185–192.
 H. Straubing, Finite Automata, Formal Logic, and Circuit Complexity, Birkhäuser, 1994.
 Title
 A constantspace sequential model of computation for firstorder logic
 Book Title
 Logic and Computational Complexity
 Book Subtitle
 International Workshop LCC'94 Indianapolis, IN, USA, October 13–16, 1994 Selected Papers
 Pages
 pp 447462
 Copyright
 1995
 DOI
 10.1007/3540601783_97
 Print ISBN
 9783540601784
 Online ISBN
 9783540447207
 Series Title
 Lecture Notes in Computer Science
 Series Volume
 960
 Series ISSN
 03029743
 Publisher
 Springer Berlin Heidelberg
 Copyright Holder
 SpringerVerlag
 Additional Links
 Topics
 Industry Sectors
 eBook Packages
 Editors
 Authors

 Steven Lindell ^{(1)}
 Author Affiliations

 1. Department of Computer Science, Haverford College, 190411392, Haverford, PA
Continue reading...
To view the rest of this content please follow the download PDF link above.