On Compiling Structured CNFs to OBDDs - PMC
We present new results on the size of OBDD representations of structurally characterized classes of CNF formulas. First, we prove that variable convex formulas (that is, formulas with incidence graphs that are convex with respect to the set of variables) ...
Theory Comput Syst . 2016 Oct 26;61(2):637–655. doi: 10.1007/s00224-016-9715-z On Compiling Structured CNFs to OBDDs Simone Bova Simone Bova 1 Institute of Computer Graphics and Algorithms, TU Wien, 1040 Vienna, Austria Find articles by Simone Bova 1 , Friedrich Slivovsky Friedrich Slivovsky 1 Institute of Computer Graphics and Algorithms, TU Wien, 1040 Vienna, Austria Find articles by Friedrich Slivovsky 1, ✉ Author information Article notes Copyright and License information 1 Institute of Computer Graphics and Algorithms, TU Wien, 1040 Vienna, Austria ✉ Corresponding author. Issue date 2017.
saved by
related reading
- Competitive Programmer's Handbookcses.fi
- Computational Complexity Theory (Stanford Encyclopedia of Philosophy)plato.stanford.edu
- cs.stanford.edu/~knuth/papers/claude-cycles.pdfcs.stanford.edu
- Understanding Convolutions on Graphsdistill.pub
- Shtetl-Optimized >> Blog Archive >> Ten Signs a Claimed Mathematical Breakthrough is Wrongscottaaronson.blog
- A Brief Introduction to Fourier Analysis on the Boolean Cubetheoryofcomputing.org
- BiereCimattiClarkeStrichmanZhu-Advances-58-2003-preprint.pdffmv.jku.at
- Artur`s homepage | Artur Riazanovtunyash.github.io
- Ch12.pdfmath.uni-hamburg.de
- True quantified Boolean formula - Wikipediaen.wikipedia.org
- Publications — Jacob Foxstanford.edu
- Proofs, beliefs and algorithms through the lens of Sum of Squaressumofsquares.org