scientific article; zbMATH DE number 1067837
From MaRDI portal
Publication:4358435
Asymptotic enumeration (05A16) Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Nonlinear programming (90C30)
Recommendations
Cited in
(15)- Approximate counting: a detailed analysis
- Measure concentration in optimization
- On the mean radius of permutation polytopes
- Log-concave polynomials. I: Entropy and a deterministic approximation algorithm for counting bases of matroids
- Generalized approximate counting revisited
- OPTIMAL DYNAMIC BOX-COUNTING ALGORITHM
- Approximate counting : an alternative approach
- Approximately Counting Locally-Optimal Structures
- Approximate range counting revisited
- Approximate Counting with Deterministic Guarantees for Affinity Computation
- Approximate set union via approximate randomization
- Approximate set union via approximate randomization
- Smoothed counting of 0–1 points in polyhedra
- Expected number of steps of a random optimization method. Reply
- Random weighting, asymptotic counting, and inverse isoperimetry
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4358435)