Searching for "On Bounded Query Machines." – sorted by Relevance.
-
Characterizations of Logarithmic Advice Complexity Classes
- sets, as well as using bounded query machines. Here (and later on as well) the symbol T will always
- Cited by 2 (2 self) – Add To MetaCart
-
Measure One Results In Computational Complexity Theory
- (\Delta)\PhiQBF were studied in [15, 28]. The corresponding machines are called bounded query machines
- Cited by 5 (3 self) – Add To MetaCart
-
The Structure of Logarithmic Advice Complexity Classes
- classes of regularly structured tally sets, as well as using bounded query machines. Theorem 18
- Cited by 13 (3 self) – Add To MetaCart

