Searching for "On Truth-Table Reducibility to SAT" – sorted by Relevance.
5 documents found, showing 1 through 5.
-
On Truth-Table Reducibility to SAT
- … Boolean circuits to SAT is the same as logspace truth-table reducibility via Boolean formulas to SAT…
- Cited by 41 (2 self) – Add To MetaCart
-
On Truth-Table Reducibility to SAT and the Difference Hierarchy over NP
- … truth-table reducibility via Boolean circuits to SAT is the same as log space truth-table reducibility…
- Cited by 12 (2 self) – Add To MetaCart
-
Complexity-Restricted Advice Functions
- … that is nondeterministically truth-table reducible to SAT in the sense of Rich [35] is already deterministically truth-table…
- Cited by 12 (4 self) – Add To MetaCart
-
Axiomatizations and Conservation Results for Fragments of Bounded Arithmetic
- … if it is polynomial time truth table reducible to a set in # p i . 4 # b i -IND ## # b i -IND ## # b i -MIN…
- Cited by 24 (1 self) – Add To MetaCart
-
A Taxonomy of Complexity Classes of Functions
- … and robust complexity class. It is equal to the class of sets that are polynomial time truth-table reducible…
- Cited by 78 (12 self) – Add To MetaCart
Showing 1 through 5.
