Jin-yi Cai, Ajay Nerurkar, D. Sivakumar
Hardness and Hierarchy Theorems for Probabilistic Quasi-Polynomial Time
STOC, 1999.
@inproceedings{STOC-1999-CaiNS, author = "Jin-yi Cai and Ajay Nerurkar and D. Sivakumar", booktitle = "{Proceedings of the 31st Annual ACM Symposium on Theory of Computing}", doi = "10.1145/301250.301444", isbn = "1-58113-067-8", pages = "726--735", publisher = "{ACM}", title = "{Hardness and Hierarchy Theorems for Probabilistic Quasi-Polynomial Time}", year = 1999, }