Skip Navigation

The Computer Journal 1991 34(3):279-282; doi:10.1093/comjnl/34.3.279
© 1991 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Akman, V.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Short Notes

Implementation of Karp-Luby Monte Carlo method: an exercise in approximate counting

V. Akman *

Department of Computer and Information Science, Bilkent University, PO Box 8 06572, Maltepe, Ankara, Turkey

Richard Karp and Michael Luby introduced a powerful framework for the construction of Monte Carlo algorithms to solve hard counting problems [cf. Journal of Complexity1 (1), 45-64 (1985)]. They then applied it, as a special case, to the problem of counting the number of satisfying truth-value assignments for a Boolean formula in disjunctive normal form. In this paper, we describe an implementation of that algorithm. Our experiments show that it indeed works very well in practice.

Received June 1987.

* Now at: Department of Computer and Information Science, Bilkent University, PO Box 8 06572, Maltepe, Ankara, Turkey.

§ Centre for Mathematics and Computer Science (CWI), Kruislaan 413, 1098 SJ Amsterdam, the Netherlands.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.