Pages that link to "Item:Q4358435"
From MaRDI portal
The following pages link to Approximate counting via random optimization (Q4358435):
Displaying 14 items.
- Expected number of steps of a random optimization method. Reply (Q801821) (← links)
- Random weighting, asymptotic counting, and inverse isoperimetry (Q995359) (← links)
- Approximate counting: a detailed analysis (Q1057061) (← links)
- Measure concentration in optimization (Q1365046) (← links)
- On the mean radius of permutation polytopes (Q1765513) (← links)
- Log-concave polynomials. I: Entropy and a deterministic approximation algorithm for counting bases of matroids (Q2059021) (← links)
- Generalized approximate counting revisited (Q2474230) (← links)
- OPTIMAL DYNAMIC BOX-COUNTING ALGORITHM (Q3086297) (← links)
- Approximate counting : an alternative approach (Q3358234) (← links)
- Approximately Counting Locally-Optimal Structures (Q3448823) (← links)
- Approximate range counting revisited (Q4958384) (← links)
- Approximate Counting with Deterministic Guarantees for Affinity Computation (Q5357750) (← links)
- Approximate set union via approximate randomization (Q5919116) (← links)
- The distance approach to approximate combinatorial counting (Q5956633) (← links)