Pseudorandom Self-Reductions for NP-Complete Problems.
Reyad Abed ElrazikRobert RobereAssaf SchusterGal YehudaPublished in: Electron. Colloquium Comput. Complex. (2021)
Keyphrases
- pseudorandom
- np complete problems
- np complete
- graph coloring
- phase transition
- uniformly distributed
- random number
- secret key
- hard problems
- sat problem
- satisfiability problem
- decision problems
- combinatorial problems
- constraint satisfaction problems
- np hard
- computational complexity
- scheduling problem
- multi objective
- special case
- evolutionary algorithm