This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A.V.Aho, J.E.Hopcroft and J.D.Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.
A.V.Aho and J.D.Ullman, Universality of Data Retrieval Languages, Proc of 6th ACM POPL, 1979.
A.K. Chandra and D. Harel, Structure and Complexity of Relational Queries, JCSS, 25 (1), 1982.
Jin-yi Cai and N.Immerman, An Optimal Lower Bound on the Number of Variables for Graph Identification, Tech. Report, Dept. of Computer Science, Yale University, 1988.
P.Dublish, Optimization and Expressibility of Relational Queries, Ph.D. Thesis, Dept of Computer Science & Engg., IIT Delhi, 1988.
P.Dublish and S.N.Maheshwari, Query Languages which Express all PTIME Queries for Trees, Technical Report 2/89, Institut für Informatik, Universität Hildesheim, 1989.
H.Enderton, A Mathematical Introduction to Logic, Academic Press, 1972.
Y.Gurevich and S.Shelah, Fixed-Point Extensions of First-Order Logic, Proc. of 26th IEEE FOCS, 1985.
N.Immerman, Relational Queries Computable in Polynomial Time, Information and Control, 68, 1986.
S.Lindell, The Logical Complexity of Queries on Unordered Graphs, Ph.D. Thesis, Dept. of Computer Science, UCLA, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dublish, P., Maheshwari, S.N. (1990). Query languages which express all PTIME queries for trees and unicyclic graphs. In: Rovan, B. (eds) Mathematical Foundations of Computer Science 1990. MFCS 1990. Lecture Notes in Computer Science, vol 452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029615
Download citation
DOI: https://doi.org/10.1007/BFb0029615
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52953-8
Online ISBN: 978-3-540-47185-1
eBook Packages: Springer Book Archive