The Relative Exponential Time Complexity of Approximate Counting Satisfying Assignments

Patrick Traxler. The Relative Exponential Time Complexity of Approximate Counting Satisfying Assignments. In Marek Cygan, Pinar Heggernes, editors, Parameterized and Exact Computation - 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers. Volume 8894 of Lecture Notes in Computer Science, pages 332-341, Springer, 2014. [doi]

Abstract

Abstract is missing.