Are all injective knapsacks partly solvable after multiplication modulo q?

Ingemar Ingemarsson

Published in: SIGACT News (1983)

Keyphrases

knapsack problem
np hard
special case
np complete
floating point
computational complexity
arithmetic operations
integer arithmetic
dynamic programming
matrix multiplication
optimization problems
probabilistic model
data sets
preprocessing
optimal solution
multiscale
face recognition
data mining