The Expressiveness of a Family of Finite Set Languages (1991)

by Neil Immerman , Sushant Patnaik , David Stemple
Venue:IN PROCEEDINGS OF 10TH ACM SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS
Citations:28 - 3 self

Documents Related by Co-Citation

250 Structure and Complexity of Relational Queries – Ashok Chandra, David Harel - 1982
131 Naturally Embedded Query Languages – Val Breazu-tannen, Peter Buneman, Limsoon Wong - 1992
108 Structural Recursion as a Query Language – Val Breazu-tannen, Peter Buneman, Shamim Naqvi - 1991
541 The complexity of relational query languages – M Y Vardi - 1982
276 Relational Queries Computable in Polynomial Time – Neil Immerman - 1986
123 On The Power Of Languages For The Manipulation Of Complex Objects – Serge Abiteboul, Catriel Beeri - 1993
67 Logical and Computational Aspects of Programming with Sets/Bags/Lists – Val Breazu-tannen, Ramesh Subrahmanyam - 1991
1612 Foundations of Databases – S Abiteboul, R Hull, V Vianu - 1995
191 A New Recursion-Theoretic Characterization Of The Polytime Functions – Stephen Bellantoni, Stephen Cook - 1992