Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

19

APPROX
2000
Springer

favoriteEmaildiscussreport

84views Algorithms» more APPROX 2000»

On the relative complexity of approximate counting problems

13 years 11 months ago

On the relative complexity of approximate counting problems

Download web.maths.unsw.edu.au

Martin E. Dyer, Leslie Ann Goldberg, Catherine S.

Real-time Traffic

Algorithms | APPROX 2000 |

claim paper

Related Content

» Target Counting under Minimal Sensing Complexity and Approximations

» The Complexity of Approximating BoundedDegree Boolean CSP

» Counting Inversions Offline Orthogonal Range Counting and Related Problems

» On approximate halfspace range counting and relative epsilonapproximations

» Randomized algorithms for tracking distributed count frequencies and ranks

» On the Complexity of Approximating TSP with Neighborhoods and Related Problems

» Approximate counting by dynamic programming

» Approximately counting integral flows and cellbounded contingency tables

» Exploiting Problem Structure for Solution Counting

Post Info
More Details (n/a)

Added	02 Aug 2010
Updated	02 Aug 2010
Type	Conference
Year	2000
Where	APPROX
Authors	Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum

Comments (0)