scientific article; zbMATH DE number 1057883
From MaRDI portal
Publication:4352952
Recommendations
- scientific article; zbMATH DE number 1670534
- The relative complexity of approximate counting problems
- Some problems on approximate counting in graphs and matroids
- The complexity of counting colourings and independent sets in sparse graphs and hypergraphs
- An analysis of Monte Carlo algorithms for counting problems
Cited in
(11)- Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
- Approximate counting : an alternative approach
- On counting and approximation
- Fragments of approximate counting
- Multi-dimensional versions of a formula of Popoviciu
- The relative complexity of approximate counting problems
- Approximate counting: a detailed analysis
- The many aspects of counting lattice points in polytopes
- On the algebraic complexity of some families of coloured Tutte polynomials
- The complexity of counting problems
- Counting and sampling orientations on chordal graphs
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 Q4352952)
