Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/86914
Authors: 
Dupuis, Paul
Kaynar, Bahar
Ridder, Ad
Rubinstein, Reuven
Vaisman, Radislav
Year of Publication: 
2011
Series/Report no.: 
Tinbergen Institute Discussion Paper 11-062/4
Abstract: 
We apply the splitting method to three well-known counting problems, namely 3-SAT, random graphs with prescribed degrees, and binary contingency tables. We present an enhanced version of the splitting method based on the capture-recapture technique, and show by experiments the superiority of this technique for SAT problems in terms of variance of the associated estimators, and speed of the algorithms.
Subjects: 
Counting
Gibbs Sampler
Capture-Recapture
Splitting
JEL: 
C15
C63
Document Type: 
Working Paper

Files in This Item:
File
Size
205.52 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.