The following pages link to (Q3999199):
Displaying 10 items.
- Average-case intractability vs. worst-case intractability (Q598182) (← links)
- Frequency computation and bounded queries (Q671360) (← links)
- A note on enumerative counting (Q809598) (← links)
- Bounded queries to SAT and the Boolean hierarchy (Q1178690) (← links)
- Boolean operations, joins, and the extended low hierarchy (Q1275091) (← links)
- Uniform constant-depth threshold circuits for division and iterated multiplication. (Q1872733) (← links)
- Relating the bounded arithmetic and polynomial time hierarchies (Q1899144) (← links)
- A complexity theory for feasible closure properties (Q2366687) (← links)
- Query-monotonic Turing reductions (Q2383592) (← links)
- Reductions to sets of low information content (Q5204315) (← links)
