The partial general search conjecture for subset sum
Statement
For a finite set and target , let denote the first subset of whose elements add up to , 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 .
Partial general search conjecture. Each instance of the subset sum problem can be solved by a partial general search routine working on a bounded domain in exponential time. This yields infinitely many particular partial functions of the form , 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 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.