(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
| Main Authors: | Σπυράκης, Παύλος Γ. (Author), Φωτάκης, Δημήτρης (Author) |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Patras
Computer Technology Institute
1996
|
| Subjects: |
Similar Items
-
On Map (Re)classification C.T.I. Technical Reports TR. 96.1.3
by: Δελής, Βασίλης, et al.
Published: (1996) -
On the Reliability of Fat-Trees C.T.I. Technical Reports TR. 96.06.18
by: Νικολετσέας, Σωτήρης, et al.
Published: (1996) -
Some new Results on Intersection Query Problems C.T.I. Technical Reports TR 96.6.20 C.T.I. Technical Reports TR 95.11.36
by: Κίτσιος, Ν., et al.
Published: (1996) -
Efficient Scheduling of Multithreaded Computations [C.T.I. Technical Reports] TR. 96. 9. 26
by: Σπυράκης, Παύλος Γ., et al.
Published: (1996) -
"Paradigms for Fast Parallel Approximability" [ C.T.I. Technical Reports] TR. 96.10.33
by: Diaz, J., et al.
Published: (1996)