Login / Signup
Polynomially Solvable Instances of the Shortest and Closest Vector Problems With Applications to Compute-and-Forward.
Saeid Sahraei
Michael Gastpar
Published in:
IEEE Trans. Inf. Theory (2017)
Keyphrases
</>
np complete
polynomially solvable
genetic algorithm
cost function
multi class
neural network
training set
feature vectors
special case
constraint satisfaction problems
branch and bound algorithm
np complete problems
run times
makespan minimization