Pseudorandom Bits and Lower Bounds for Randomized Turing Machines.
Emanuele ViolaPublished in: Theory Comput. (2022)
Keyphrases
- pseudorandom
- turing machine
- lower bound
- randomized algorithms
- random numbers
- upper bound
- secret data
- randomized algorithm
- uniformly distributed
- random number
- secret key
- branch and bound
- branch and bound algorithm
- worst case
- objective function
- np hard
- encryption algorithm
- lower and upper bounds
- decision forest
- online algorithms
- real time