A query language for NC
From MaRDI portal
Publication:1376409
DOI10.1006/jcss.1997.1525zbMath0887.68024OpenAlexW2022357808MaRDI QIDQ1376409
Publication date: 17 December 1997
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/05c4803c54775be1de33aa4e9cde64679f17d840
Related Items (5)
Query languages for bags and aggregate functions ⋮ The complexity of the evaluation of complex algebra expressions ⋮ Bounded fixpoints for complex objects ⋮ A query language for NC (extended abstract) ⋮ Separating NC along the \(\delta\) axis
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The expressiveness of a family of finite set languages
- Principles of programming with complex objects and collection types
- Finite-model theory -- A personal perspective
- The relational model with relation-valued attributes
- Computable queries for relational data bases
- Upper and lower bounds for first order expressibility
- Datalog extensions for database queries and updates
- An optimal lower bound on the number of variables for graph identification
- Elementary induction on abstract structures
- Hereditarily-finite sets, data bases and polynomial-time computability
- Bounded fixpoints for complex objects
- Infinitary logic and inductive definability over finite structures
- Tractable query languages for complex object databases
- On uniformity within \(NC^ 1\)
- Simulation of Parallel Random Access Machines by Circuits
- A taxonomy of problems with fast parallel algorithms
- Relational queries computable in polynomial time
- Languages that Capture Complexity Classes
- Expressibility and Parallel Complexity
- Fixpoint logics, relational machines, and computational complexity
This page was built for publication: A query language for NC
