Pseudorandom Self-Reductions for NP-Complete Problems.
Reyad Abed ElrazikRobert RobereAssaf SchusterGal YehudaPublished in: ITCS (2022)
Keyphrases
- pseudorandom
- np complete problems
- np complete
- graph coloring
- phase transition
- uniformly distributed
- random number
- secret key
- hard problems
- sat problem
- job shop scheduling
- randomly generated
- evolutionary algorithm
- constraint satisfaction
- low cost
- combinatorial problems
- max sat
- satisfiability problem
- decision problems
- np hard
- high dimensional