The following pages link to (Q2753731):
Displaying 23 items.
- The relative exponential time complexity of approximate counting satisfying assignments (Q309794) (← links)
- Approximate counting with \(m\) counters: A detailed analysis (Q441872) (← links)
- Approximately counting paths and cycles in a graph (Q516844) (← links)
- On the complexity of approximating the Hadwiger number (Q1006087) (← links)
- On relationships between approximate and probabilistic complexity classes (Q1326985) (← links)
- The complexity of error metrics (Q1799556) (← links)
- The relative complexity of approximate counting problems (Q1879247) (← links)
- A complexity theory for hard enumeration problems (Q2274092) (← links)
- The complexity of counting problems (Q2776272) (← links)
- Majorizing estimators and the approximation of \#P-complete problems (Q2819556) (← links)
- Descriptive Complexity of approximate counting CSPs (Q2958520) (← links)
- Approximately Counting Locally-Optimal Structures (Q3448823) (← links)
- On Approximation Algorithms for # P (Q3718150) (← links)
- (Q4427867) (← links)
- (Q4967222) (← links)
- Approximate Counting CSP Seen from the Other Side (Q5053062) (← links)
- Approximate counting and NP search problems (Q5055313) (← links)
- Fine-Grained Reductions from Approximate Counting to Decision (Q5065630) (← links)
- (Q5092423) (← links)
- Efficient deterministic approximate counting for low-degree polynomial threshold functions (Q5259619) (← links)
- Approximate Counting with Deterministic Guarantees for Affinity Computation (Q5357750) (← links)
- On the Complexity of Approximate Sum of Sorted List (Q5405940) (← links)
- Polynomial-time algorithms for multimarginal optimal transport problems with structure (Q6038667) (← links)
