On Hashing-Based Approaches to Approximate DNF-Counting

Simple item page
dc.contributor.advisorVardi, Moshe Y
dc.creatorShrotri, Aditya Aniruddha
dc.date.accessioned2019-05-17T13:20:15Z
dc.date.available2019-05-17T13:20:15Z
dc.date.created2017-12
dc.date.issued2017-11-07
dc.date.submittedDecember 2017
dc.date.updated2019-05-17T13:20:16Z
dc.description.abstractPropositional model counting is a fundamental problem in AI. For DNF formulas, Monte Carlo-based techniques provide a fully polynomial randomized approximation scheme (FPRAS). For CNF constraints, hashing-based techniques are highly successful. It was recently shown that hashing techniques also yield an FPRAS for DNF counting. Our analysis, however, shows that the proposed hashing approach provides poor time complexity compared to the Monte Carlo techniques, for DNF Counting. Given the success of hashing techniques for CNF constraints, it is natural to ask: Can hashing techniques provide an efficient FPRAS for DNF counting? We provide a positive answer to this question. We introduce two novel algorithmic techniques: Symbolic Hashing and Stochastic Cell Counting, and a new family of Row-Echelon hash functions. We design a hashing-based FPRAS of similar complexity (up to polylog factors) as that of prior works. We also provide an empirical comparison of the various approaches.
dc.format.mimetypeapplication/pdf
dc.identifier.citationShrotri, Aditya Aniruddha. "On Hashing-Based Approaches to Approximate DNF-Counting." (2017) Master’s Thesis, Rice University. <a href="https://hdl.handle.net/1911/105582">https://hdl.handle.net/1911/105582</a>.
dc.identifier.urihttps://hdl.handle.net/1911/105582
dc.language.isoeng
dc.rightsCopyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder.
dc.subjectModel Counting
dc.subjectDNF Formulas
dc.subjectHash Functions
dc.titleOn Hashing-Based Approaches to Approximate DNF-Counting
dc.typeThesis
dc.type.materialText
thesis.degree.departmentComputer Science
thesis.degree.disciplineEngineering
thesis.degree.grantorRice University
thesis.degree.levelMasters
thesis.degree.nameMaster of Science
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
SHROTRI-DOCUMENT-2017.pdf
Size:
803.17 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 2 of 2
No Thumbnail Available
Name:
PROQUEST_LICENSE.txt
Size:
5.85 KB
Format:
Plain Text
Description:
Download
No Thumbnail Available
Name:
LICENSE.txt
Size:
2.62 KB
Format:
Plain Text
Description:
Download
Collections
Rice University Electronic Theses and Dissertations