The following pages link to A note on enumerative counting (Q809598):
Displaying 11 items.
- On the power of enumerative counting (Q1199550) (← links)
- On the hardness of computing the permanent of random matrices (Q1355377) (← links)
- Some connections between bounded query classes and non-uniform complexity. (Q1426008) (← links)
- Tally NP sets and easy census functions. (Q1854340) (← links)
- Optimal series-parallel trade-offs for reducing a function to its own graph (Q1854508) (← links)
- The enumerability of P collapses P to NC (Q2575747) (← links)
- The Power of Self-Reducibility: Selectivity, Information, and Approximation (Q3297822) (← links)
- Reconstructing Algebraic Functions from Mixed Data (Q4210162) (← links)
- Reductions to sets of low information content (Q5204315) (← links)
- Enumerations of the Kolmogorov function (Q5480623) (← links)
- The communication complexity of enumeration, elimination, and selection (Q5956009) (← links)
