The conjecture that diffusion-equation solution computation is #P-complete
Statement
Let and consider the initial-boundary value problems and solution operators described in Theorems 1 and 2, including the stated polynomial-time computability and support conditions on the data. #P-completeness conjecture. Under the conditions of those theorems, the computation of the solution is -complete. The preceding results place the computation in but do not establish -hardness; proving or disproving this claim is left as future work.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.