ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let MM be a matrix and let per⁡αM\operatorname{per}_{\alpha}M denote its alpha-permanent. For a positive integer kk, the notation #P\#P refers to the relevant counting-complexity class, and PP to deterministic polynomial time.

Computational complexity conjecture. Computation of the α\alpha-permanent is #P\#P-complete, except for

α∈{−1,…,−K},\alpha\in\{-1,\ldots,-K\},

for some K∈N∪{∞}K\in\mathbb{N}\cup\{\infty\}. The complexity for α∈{−2,−3,…}\alpha\in\{-2,-3,\ldots\} lies somewhere between PP and #P\#P and is monotonically non-decreasing as α\alpha decreases.

The paper notes that the computational complexity of the alpha-permanent had not been studied and leaves open the possibility that K=1K=1, in which case only α=−1\alpha=-1 is exceptional. The authors further identify the central expectation as #P\#P-completeness unless α\alpha is a negative integer.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.