scientific article; zbMATH DE number 2080032

MaRDI QIDQ4472219zbMATH OpenFDO

Authors Jose Maria Turull Torres

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2284/22840212.htm

Mathematics Subject Classification ID

Logic in computer science (03B70) Complexity of computation (including implicit computational complexity) (03D15) Database theory (68P15)

Recommendations

• scientific article; zbMATH DE number 5060895
• A study of homogeneity in relational databases
• scientific article; zbMATH DE number 1507289
• scientific article; zbMATH DE number 1950753
• On the expressibility and the computability of untyped queries

Cited in

(6)

• Choiceless polynomial time
• A study of homogeneity in relational databases
• scientific article; zbMATH DE number 1950753 (Why is no real title available?)
• scientific article; zbMATH DE number 1507289 (Why is no real title available?)
• scientific article; zbMATH DE number 5060895 (Why is no real title available?)
• On the expressibility and the computability of untyped queries

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4472219)