From post

(poly(log log n), poly(log log n))-Restricted Verifiers are Unlikely to Exist for Languages in NP.

, и . MFCS, том 1113 из Lecture Notes in Computer Science, стр. 360-371. Springer, (1996)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем