Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Jingcheng Liu, Pinyan Lu. FPTAS for Counting Monotone CNF. In Piotr Indyk, editor, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015. pages 1531-1548, SIAM, 2015. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: A Simple FPTAS for Counting Edge CoversChengyu Lin, Jingcheng Liu, Pinyan Lu. soda 2014: 341-348 [doi] FPTAS for Counting Weighted Edge CoversJingcheng Liu, Pinyan Lu, Chihao Zhang. esa 2014: 654-665 [doi] An FPTAS for Counting Proper Four-Colorings on Cubic GraphsPinyan Lu, Kuan Yang, Chihao Zhang, Minshen Zhu. soda 2017: 1798-1817 [doi]
The following publications are possibly variants of this publication: