Login / Signup
The Bounded Subset Sum Problem is Almost Everywhere Randomly Decidable in O(n).
Gottfried Tinhofer
Helmut Schreck
Published in:
Inf. Process. Lett. (1986)
Keyphrases
</>
first order logic
asymptotically optimal
greedy algorithms
databases
genetic algorithm
knowledge representation
randomly chosen