Σπυράκης, Π. Γ., & Φωτάκης, Δ. (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 (17η εκδ.)Σπυράκης, Παύλος Γ., και Δημήτρης Φωτάκης. (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 εκδ.)Σπυράκης, Παύλος Γ., και Δημήτρης Φωτάκης. (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.