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

Fotakis, D; Spirakis, P

dc.contributor.author	Fotakis, D	en
dc.contributor.author	Spirakis, P	en
dc.date.accessioned	2014-03-01T02:48:21Z
dc.date.available	2014-03-01T02:48:21Z
dc.date.issued	1996	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33753
dc.subject	Expander Graph	en
dc.title	(poly(log log n), poly(log log n))Restricted Verifiers are Unlikely to Exist for Languages in NP	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/3-540-61550-4_162	en
heal.identifier.secondary	http://dx.doi.org/10.1007/3-540-61550-4_162	en
heal.publicationDate	1996	en
heal.abstract	. The aim of this paper is to present a proof of the equivalenceof the equalities NP = PCP(log log n; 1) and P = NP. Theproof is based on producing long pseudo-random bit strings throughrandom walks on expander graphs. This technique also implies that forany language in NP there exists a restricted verifier using log n + c, cis	en
heal.journalName	Mathematical Foundations of Computer Science	en
dc.identifier.doi	10.1007/3-540-61550-4_162	en