On Basing One-way Permutations on NP-hard Problems under Quantum Reductions.

Nai-Hui Chia Sean Hallgren Fang Song

Published in: CoRR (2018)

Keyphrases

np hard problems
knapsack problem
np hard
constraint programming
graph coloring
combinatorial search
constraint satisfaction
special case
constraint satisfaction problems
branch and bound algorithm
combinatorial problems