Q4375806
type: Item
instance of: scholarly article
zbMATH Open document ID: 0886.03034
author: Richard Beigel
author: Timothy H. McNicholl
author: William Gasarch
author: Martin Kummer
author: Georgia A. Martin
author: Frank Stephan
publication date: 1998-05-10T00:00:00Z
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 03D30
zbMATH DE Number: 1114037
zbMATH Keywords: query complexity
zbMATH Keywords: tt-degree
MaRDI profile type: Publication
Recommended article: Query complexity of membership comparable sets.
Recommended article: On the complexity of set-based analysis
Recommended article: Q3140421
Recommended article: Lower bounds for set intersection queries
Recommended article: On the computational complexity of defining sets
Recommended article: Computational complexity of queries based on itemsets
Recommended article: Bounded queries to arbitrary sets
Recommended article: A Theory of Local Set Queries
Recommended article: On the Complexity of Hard-Core Set Constructions
Recommended article: On the Structure of Bounded Queries to Arbitrary NP Sets
description: scientific article; zbMATH DE number 1114037