On the computational hardness needed for quantum cryptography.
Zvika BrakerskiRan CanettiLuowen QianPublished in: IACR Cryptol. ePrint Arch. (2022)
Keyphrases
- cellular automata
- mathematical programming
- phase transition
- np hard
- np complete
- computational models
- neural network
- quantum computation
- computational complexity
- search space
- probability ranking principle
- cutting plane
- computational power
- hybrid model
- learning theory
- search algorithm
- decision trees
- decision making
- feature selection
- information systems
- computer vision
- genetic algorithm
- real world