Pages that link to "Item:Q5198932"
From MaRDI portal
The following pages link to On the parameterized complexity of approximate counting (Q5198932):
Displaying 16 items.
- Approximate counting with \(m\) counters: A detailed analysis (Q441872) (← links)
- Compactors for parameterized counting problems (Q826317) (← links)
- On the complexity of approximating the Hadwiger number (Q1006087) (← links)
- Parameterized random complexity (Q1946497) (← links)
- (Q2753731) (← links)
- Descriptive Complexity of approximate counting CSPs (Q2958520) (← links)
- Approximately Counting Locally-Optimal Structures (Q3448823) (← links)
- On Parameterized Approximability (Q3499729) (← links)
- (Q4427867) (← links)
- The Parameterized Complexity of Counting Problems (Q4651498) (← links)
- (Q4967222) (← links)
- Approximate counting and NP search problems (Q5055313) (← links)
- Fine-Grained Reductions from Approximate Counting to Decision (Q5065630) (← 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)