Publication not explained
This publication has not yet been explained in plain language by the author(s). However, you can still read the publication.
If you are one of the authors, claim this publication so you can create a plain language summary to help more people find, understand and use it.
Read the Original
This page is a summary of: The Relative Complexity of Approximate Counting Problems, Algorithmica, December 2003, Springer Science + Business Media, DOI: 10.1007/s00453-003-1073-y.
You can read the full text:
Be the first to contribute to this page