Fixed-dimensional k-Frobenius Problem hardness conjecture
Statement
Let -Frobenius Problem denote the problem defined earlier in the source. The fixed-dimensional -Frobenius Problem hardness conjecture. The -Frobenius Problem is -hard for some fixed . The source describes this as a significantly stronger conjectural hardness statement and gives no resolution.
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.