Abstract
The paper indicates how the validity of a fixed first order formula in any finite structure can be checked by realistic local memory parallel computers.
Preview
Unable to display preview. Download preview PDF.
References
F. Abolhassan, J. Keller, W. Paul: On physical realizations of the theoretical PRAM model, Technical Report # 21/90, Sonderforschungsbereich 124 — VLSI-Entwurfsmethoden und Parallelität, University of Saarbrücken.
, S. Akl: The design and analysis of parallel algorithms, Prentice Hall, Englewood Cliffs, New Jersey, 1989
B. Awerbuch, A. Israeli, Y. Shiloach: Efficient simulation of PRAM by ultracomputer, preprint, Technion-Israel Institute of Technology, 1983.
B. Awerbuch, Y. Shiloach: New connectivity and MSF algorithms for shuffle exchange network and PRAM, IEEE-Transactions on Computing C-36 (1987), pp. 1258–1263.
K. Batcher: Sorting networks and their applications, Proceedings of the AFIPS 1968, Atlanta City, New jersey, pp. 307–314.
Y. Chin, Y. Lam, I. Chen: Efficient parallel algorithms for some graph problems, Communication of the ACM 25 (1982), pp. 659–665.
S. Cook: A taxonomy of problems with fast parallel algorithms, Information and Control 64 (1985), pp. 2–22.
R. Cypher, G. Plaxton: Deterministic sorting in nearly logarithmic time on a hypercube and related computers, 2n d ACM-STOC (1990), pp. 193–203.
R. Fagin: Generalized first order spectra and polynomial time recognizable sets, in ”Complexity of Computations” (R. Karp ed.), SIAM-AMS-proceedings 7 (1974), pp.27–41.
S. Fortune, J. Wyllie: Parallelism in random access machines, 10th ACM-STOC (1978), pp. 114–118.
A. Gibbons, W. Rytter: Efficient Parallel Algorithms, Cambridge University Press, Cambridge, 1989.
N. Immerman: Languages which capture complexity classes, 15th ACM-STOC (1983) pp. 347–354.
N. Immerman: Expressibility and parallel complexity, SIAM-Journal on Computing 18 (1989), pp. 625–638.
N. Jones, A. Selman: Turing machines and spectra of first order formulas, Journal of Symbolic Logic 39 (1974), pp. 139–150.
R. Miller, Q. Stout: Graph and image processing algorithms for hypercube, Proceedings 1986 SIAM Conference on Hypercube Multiprocessors (1987), pp. 418–425.
A. Ranade: How to emulate shared memory, IEEE-FOCS 1987, pp.185–194.
D. Rödding, H. Schwichtenberg: Bemerkungen zum Spektralproblem, Zeitschrift für Mathematische Logik 18 (1972), pp. 1–12.
E. Upfal: An O(log N) deterministic packet routing scheme, 21st ACM-STOC (1989), pp. 241–250.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dahlhaus, E. (1992). How to implement first order formulas in local memory machine models. In: Börger, E., Jäger, G., Kleine Büning, H., Richter, M.M. (eds) Computer Science Logic. CSL 1991. Lecture Notes in Computer Science, vol 626. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023758
Download citation
DOI: https://doi.org/10.1007/BFb0023758
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55789-0
Online ISBN: 978-3-540-47285-8
eBook Packages: Springer Book Archive