Searching for "Bounds in Weak Truth-Table Reducibility." – sorted by Relevance.
-
Bounded Query Classes and the Difference Hierarchy
- . (bounded weak truth-table reducibility) A bwtt B iff A wtt B and there is a fixed n such that k x n
- Cited by 15 (12 self) – Add To MetaCart
-
Simple Sets and Strong Reducibilities
- , for all x, B(x) = (x; A(0)A(1) : : : A(f(x))): (4) A set B is bounded weak truth-table reducible to A
- Add To MetaCart

