Recommendations
- A query language for NC (extended abstract)
- scientific article; zbMATH DE number 1903404
- scientific article; zbMATH DE number 1629811
- Query languages for hierarchic databases
- Towards a semantic query language
- A query language for logic architectures
- A query language based on term matching and rewriting
- scientific article; zbMATH DE number 1319352
Cites work
- scientific article; zbMATH DE number 176199 (Why is no real title available?)
- scientific article; zbMATH DE number 176725 (Why is no real title available?)
- scientific article; zbMATH DE number 1142303 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- A taxonomy of problems with fast parallel algorithms
- An optimal lower bound on the number of variables for graph identification
- Bounded fixpoints for complex objects
- Computable queries for relational data bases
- Datalog extensions for database queries and updates
- Elementary induction on abstract structures
- Expressibility and Parallel Complexity
- Finite-model theory -- A personal perspective
- Fixpoint logics, relational machines, and computational complexity
- Hereditarily-finite sets, data bases and polynomial-time computability
- Infinitary logic and inductive definability over finite structures
- Languages that Capture Complexity Classes
- On uniformity within \(NC^ 1\)
- Principles of programming with complex objects and collection types
- Relational queries computable in polynomial time
- Simulation of Parallel Random Access Machines by Circuits
- The expressiveness of a family of finite set languages
- The relational model with relation-valued attributes
- Tractable query languages for complex object databases
- Upper and lower bounds for first order expressibility
Cited in
(5)
This page was built for publication: A query language for NC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1376409)
