REVIEW 2 cited by
What is in #P and what is not?
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
For several classical nonnegative integer functions, we investigate if they are members of the counting complexity class #P or not. We prove #P membership in surprising cases, and in other cases we prove non-membership, relying on standard complexity assumptions or on oracle separations. We initiate the study of the polynomial closure properties of #P on affine varieties, i.e., if all problem instances satisfy algebraic constraints. This is directly linked to classical combinatorial proofs of algebraic identities and inequalities. We investigate #TFNP and obtain oracle separations that prove the strict inclusion of #P in all standard syntactic subclasses of #TFNP-1.
Forward citations
Cited by 2 Pith papers
-
Equality conditions for correlation inequalities
Equality in the Ahlswede–Daykin and FKG inequalities holds if and only if the underlying lattice decomposes as a direct product and the functions cross-factor across the two components.
-
Positivity of Schubert Coefficients
Under GRH and the Miltersen-Vinodchandran assumption, the positivity of Schubert coefficients has a positive rule, equivalent to the problem being in NP.
Discussion (0). Continue with ORCID to comment.