The following pages link to Effective Search Problems (Q4304108):
Displaying 10 items.
- Frequency computation and bounded queries (Q671360) (← links)
- Extremes in the degrees of inferability (Q1319507) (← links)
- Optimal series-parallel trade-offs for reducing a function to its own graph (Q1854508) (← links)
- The query complexity of witness finding (Q2411034) (← links)
- A proof of Beigel's cardinality conjecture (Q4032650) (← links)
- (Q4677211) (← links)
- The complexity of ODD<sub><i>n</i></sub><sup><i>A</i></sup> (Q4953205) (← links)
- Enumerations of the Kolmogorov function (Q5480623) (← links)
- Weak cardinality theorems (Q5718691) (← links)
- Searching games with errors -- fifty years of coping with liars (Q5958303) (← links)