A Subexponential Construction of Graph Coloring for Multiparty Computation.
Hassan Jameel AsgharYvo DesmedtJosef PieprzykRon SteinfeldPublished in: IACR Cryptol. ePrint Arch. (2014)
Keyphrases
- multi party
- graph coloring
- combinatorial problems
- privacy preserving
- job shop scheduling
- max sat
- phase transition
- scheduling problem
- mental states
- description language
- constraint satisfaction problems
- hyper heuristics
- neural network
- traveling salesman problem
- constraint programming
- lower bound
- artificial intelligence