Probabilistic computations: Mild derandomizatons and zero-knowledge classes

P Dixon - 2021 - search.proquest.com
Random algorithms have a unique place in complexity theory as a model of computation
that ispotentially more powerful than “normal” algorithms, and is also practical. However, it is …