output
20122024
most citedThe Pipeline for the Continuous Development of Artificial Intelligence Models -- Current State of Research and Practice

120 citations

researchers with a paper here
collaborating institutions
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2012

The Relative Exponential Time Complexity of Approximate Counting Satisfying Assignments

Patrick Traxler

We study the exponential time complexity of approximate counting satisfying assignments of CNFs. We reduce the problem to deciding satisfiability of a CNF. Our reduction preserves…