Linear constraint query languages expressive power and complexity
From MaRDI portal
Publication:6064293
Recommendations
Cites work
- scientific article; zbMATH DE number 3132763 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3607517 (Why is no real title available?)
- scientific article; zbMATH DE number 1142309 (Why is no real title available?)
- scientific article; zbMATH DE number 1479611 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- A relational model of data for large shared data banks
- Completeness results for recursive data bases
- Computable queries for relational data bases
- Finitely representable databases
- First-Order Queries on Finite Structures Over the Reals
- Hamiltonian paths in infinite graphs
- On the expressive power of the relational algebra
- Parity, circuits, and the polynomial-time hierarchy
- Recursive Euler and Hamilton Paths
- Sentences true in all constructive models
- The complexity of elementary algebra and geometry
This page was built for publication: Linear constraint query languages expressive power and complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6064293)