APA (7th ed.) Citation

Σπυράκης, Π. Γ., & Φωτάκης, Δ. (1996). (poly(loglogn), poly(loglogn))-restricted verifiers are unlikely to exist for languages in NP C.T.I. Technical Report TR. 96.1.2 C.T.I. Technical Report TR, 96.3.7. Computer Technology Institute.

Chicago Style (17th ed.) Citation

Σπυράκης, Παύλος Γ., and Δημήτρης Φωτάκης. (poly(loglogn), Poly(loglogn))-restricted Verifiers Are Unlikely to Exist for Languages in NP C.T.I. Technical Report TR. 96.1.2 C.T.I. Technical Report TR, 96.3.7. Patras: Computer Technology Institute, 1996.

MLA (8th ed.) Citation

Σπυράκης, Παύλος Γ., and Δημήτρης Φωτάκης. (poly(loglogn), Poly(loglogn))-restricted Verifiers Are Unlikely to Exist for Languages in NP C.T.I. Technical Report TR. 96.1.2 C.T.I. Technical Report TR, 96.3.7. Computer Technology Institute, 1996.