Two calls to a #2DNF oracle with a single subtraction characterize gapP, strictly sandwiching #P between one and two #2DNF calls.
Completeness, approximability and exponential time results for counting problems with easy decision version.Theoretical Computer Science, 915:55–73, 2022
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.CC 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
support 1representative citing papers
citing papers explorer
-
#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought?
Two calls to a #2DNF oracle with a single subtraction characterize gapP, strictly sandwiching #P between one and two #2DNF calls.