2001
DOI: 10.1006/inco.2000.2918
|View full text |Cite
|
Sign up to set email alerts
|

Commutative Queries

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2001
2001
2001
2001

Publication Types

Select...
4

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 22 publications
0
5
0
Order By: Relevance
“…The techniques used to prove these lemmas include the census trick and the mind change technique. These techniques are fairly common in the literature on bounded query classes [Hem89,Bei91,BCO93,BC97].…”
Section: Normal Forms For Bounded Query Classesmentioning
confidence: 99%
“…The techniques used to prove these lemmas include the census trick and the mind change technique. These techniques are fairly common in the literature on bounded query classes [Hem89,Bei91,BCO93,BC97].…”
Section: Normal Forms For Bounded Query Classesmentioning
confidence: 99%
“…(1) We define FQ* (r\ A \,..., r k A k ) to be the set of all functions Turing reducible to A i © • • • © A k via a Turing machine that on any input makes a total of r t queries to Aj. (2) We define FQ(r\A\,.. .,r k A k ) to be the set of all functions that are in FQ* {r\A\,...,r k A k )viaa.…”
Section: Ai ® • • • (B a K = \^J{ka + J \ A E Aj)mentioning
confidence: 99%
“…Beigel and Chang [BC97] use the techniques in the proof of Theorem 3.2 for some new results on commutative queries.…”
Section: Claim 34 the Algorithm Inmentioning
confidence: 99%