The following pages link to Enumerative counting is hard (Q1822963):
Displaying 23 items.
- Frequency computation and bounded queries (Q671360) (← links)
- Computing functions with parallel queries to NP (Q673784) (← links)
- Choosing, agreeing, and eliminating in communication complexity (Q744609) (← links)
- A note on enumerative counting (Q809598) (← links)
- On the complexity of ranking (Q920620) (← links)
- On sets polynomially enumerable by iteration (Q1176233) (← links)
- On the power of enumerative counting (Q1199550) (← links)
- Some connections between bounded query classes and non-uniform complexity. (Q1426008) (← links)
- On the reducibility of sets inside NP to sets with low information content (Q1765294) (← 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)
- On membership comparable sets (Q1961377) (← links)
- The value of help bits in randomized and average-case complexity (Q2012180) (← links)
- A complexity theory for hard enumeration problems (Q2274092) (← links)
- The enumerability of P collapses P to NC (Q2575747) (← links)
- The Power of Self-Reducibility: Selectivity, Information, and Approximation (Q3297822) (← links)
- The complexity of ODD<sub><i>n</i></sub><sup><i>A</i></sup> (Q4953205) (← links)
- On the power of parity polynomial time (Q5096157) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311110) (← links)
- Enumerations of the Kolmogorov function (Q5480623) (← links)
- Weak cardinality theorems (Q5718691) (← links)
- On the power of parity polynomial time (Q5750401) (← links)
- The communication complexity of enumeration, elimination, and selection (Q5956009) (← links)
