On the complexity of database queries (Q1307689): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1223123
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Christos H. Papadimitriou / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/jcss.1999.1626 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2048685245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterminism within $P^ * $ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability and Completeness I: Basic Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4217593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On conjunctive queries containing inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3740256 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On limited nondeterminism and the complexity of the V-C dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank

Latest revision as of 09:12, 29 May 2024

scientific article
Language Label Description Also known as
English
On the complexity of database queries
scientific article

    Statements

    Identifiers