scientific article; zbMATH DE number 1086662

zbMATH Open0889.68051MaRDI QIDQ4362912FDOQ4362912

Authors: Stefan Dziembowski 

Publication date: 11 June 1998

Title of this publication is not available (Why is that?)

Recommendations

• Bounded fixpoints for complex objects
• The complexity of evaluating relational queries
• Fixpoint logics, relational machines, and computational complexity
• Relational queries computable in polynomial time
• Computing with first-order logic

zbMATH Keywords

relational databasesbounded-variable fixpoint queries

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Other applications of logic (03B80)

Cited In (4)

• Number of variables is equivalent to space
• Optimizing the region algebra is PSPACE-complete
• On logics with two variables
• Title not available (Why is that?)

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 Q4362912)