On the complexity of database queries
type: Item
instance of: scholarly article
title: On the complexity of database queries
zbMATH Open document ID: 0939.68024
author: Mihalis Yannakakis
author: Christos Papadimitriou
published in: Journal of Computer and System Sciences
publication date: 1999-11-09T00:00:00Z
Mathematics Subject Classification ID: 68P15
zbMATH DE Number: 1359920
zbMATH Keywords: database queries
MaRDI profile type: Publication
full work available at URL: jcss.1999.1626
OpenAlex ID: W2048685245
cites work: Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
cites work: Q4864249
cites work: Color-coding
cites work: Nondeterminism within $P^ * $
cites work: Fixed-Parameter Tractability and Completeness I: Basic Results
cites work: Q4217593
cites work: Q4385543
cites work: On conjunctive queries containing inequalities
cites work: Q3740256
cites work: On limited nondeterminism and the complexity of the V-C dimension
cites work: Graph minors. XIII: The disjoint paths problem
DOI: 10.1006/JCSS.1999.1626
description: scientific article; zbMATH DE number 1359920