The following pages link to On counting and approximation (Q1114675):
Displaying 20 items.
- Tractable counting of the answers to conjunctive queries (Q389242) (← links)
- The consequences of eliminating NP solutions (Q458458) (← links)
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- Computing functions with parallel queries to NP (Q673784) (← links)
- Complexity of counting the optimal solutions (Q837174) (← links)
- On the autoreducibility of functions (Q970103) (← links)
- Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P (Q1193633) (← links)
- A very hard log-space counting class (Q1208403) (← links)
- Nondeterministic \(NC^1\) computation (Q1276170) (← links)
- Gap-definable counting classes (Q1318473) (← links)
- A note on SpanP functions (Q1328756) (← links)
- Simple characterizations of \(P(\# P)\) and complete problems (Q1333395) (← links)
- Locating \(P\)/poly optimally in the extended low hierarchy (Q1341715) (← links)
- A note on unambiguous function classes (Q1607022) (← links)
- Tally NP sets and easy census functions. (Q1854340) (← links)
- A complexity theory for feasible closure properties (Q2366687) (← links)
- Dimension, entropy rates, and compression (Q2495412) (← links)
- Subtractive reductions and complete problems for counting complexity classes (Q2566034) (← links)
- Complexity of Counting the Optimal Solutions (Q3511323) (← links)
- The operators min and max on the polynomial hierarchy (Q5047162) (← links)
