Theoretical Computer Science Bibliography Theoretical Computer Science Bibliography Juris Hartmanis and Lane A. Hemachandra .
Robust machines accept easy sets.
Selected papers that cite this one P. Cintioli and R. Silvestri. Helping by unambiguous computation and probabilistic computation. Stephen Cook, Russell Impagliazzo, and Tomoyuki Yamakami. A tight relationship between generic oracles and type-2 complexity theory. Boolean hierarchies and sparse Turing-complete sets.