#P中有什么,没有什么?
What is in #P and what is not?
摘要:
对于几个经典的非负整数函数,我们研究了它们是否是计数复杂性类P的成员。我们在令人惊讶的情况下证明了P成员资格,在其他情况下,我们证明了非成员资格,依赖于标准的复杂性假设或Oracle分离。我们开始研究P在仿射簇上的多项式闭包性质,即,如果所有问题实例都满足代数约束。这与代数恒等式和不等式的经典组合证明直接相关。我们研究了#TFNP,并获得了证明#P严格包含在#TFNP-1的所有标准语法子类中的预言分离。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。