MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for "Relational Queries Computable in Polynomial Time" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 4 documents found, showing 1 through 4.
ATOM RSS
  • Languages for Polynomial-Time Queries - an Ongoing Quest  
  • by Phokion G. Kolaitis, Laws Information — 1992 — In Proc. 19th International Colloq. on Automata, Languages, and Programming
  • … York, 1975. Languages for Polynomial-Time Queries -- an Ongoing Quest Phokion G. Kolaitis Computer…
  • Add To MetaCart
  • Query Languages for Hierarchic Dadabases  
  • by Elias Dahlhaus, J.A. Makowsky, Ak S. Abiteboul, P. Kanellakis, Abddmz M. Atkinson, F. Bancilhon, D. Dewitt, K. Dittrich, D. Maier, Hs R. Hull, J. Su, Untyped Sets — 1990
  • …, Relational queries computable in polynomial time, 14th ACM Symposium on Theory of Computing, (1982) pp. 147…
  • Add To MetaCart
  • INDEX equality 11, 169  
  • by Tanaka Tannen Breazu-Tannen, Ullman J, Vianu V, Vickers S, Winskel G, Zicari R
  • …-objects. In PODS-89. [83] N. Immerman. Relational queries computable in polynomial time. Information and Control…
  • Add To MetaCart
Help! Showing 1 through 4.
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB