ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a finite set SS and target kk, let gk(S)g_k(S) denote the first subset of SS whose elements add up to kk, when such a subset exists. The associated search procedure is a partial function because no such subset need exist, and it searches the bounded, constructively enumerable poset of subsets of SS.

Partial general search conjecture. Each instance SS of the subset sum problem can be solved by a partial general search routine gkg_k working on a bounded domain in exponential time. This yields infinitely many particular partial functions of the form gk(S)g_k(S), each solving a different variant of the problem; there is no single finitely defined general function solving all such particular problems and, therefore, no general primitive recursive function solving all instances in polynomial time.

The claim concerns the distinction between a function scheme indexed by kk and one uniform function covering all instances. The supplied text gives no evidence that the conjecture has been resolved.

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.