Uniform hardness versus randomness tradeoffs for Arthur-Merlin games

Dan Gutfreund; Ronen Shaltiel; Amnon Ta-Shma

doi:10.1007/s00037-003-0178-7

Uniform hardness versus randomness tradeoffs for Arthur-Merlin games

Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma

Research output: Contribution to journal › Article › peer-review

Abstract

Impagliazzo and Wigderson proved a uniform hardness vs. randomness "gap theorem" for BPP. We show an analogous result for AM: Either Arthur-Merlin protocols are very strong and everything in E = DTIME(2 ^O(n)) can be proved to a subexponential time verifier, or else Arthur-Merlin protocols are weak and every language in AM has a polynomial time nondeterministic algorithm such that it is infeasible to come up with inputs on which the algorithm fails. We also show that if Arthur-Merlin protocols are not very strong (in the sense explained above) then AM ∩ coAM = NP ∩ coNP. Our technique combines the nonuniform hardness versus randomness tradeoff of Miltersen and Vinodchandran with "instance checking". A key ingredient in our proof is identifying a novel "resilience" property of hardness vs. randomness tradeoffs.

Original language	English
Pages (from-to)	85-130
Number of pages	46
Journal	Computational Complexity
Volume	12
Issue number	3-4
DOIs	https://doi.org/10.1007/s00037-003-0178-7
State	Published - 2003
Externally published	Yes

Bibliographical note

Funding Information:
The first author is supported in part by the Leibniz Center, the Israel Foundation of Science, a US-Israel Binational research grant, and an EU Information Technologies grant (IST-FP5). The second author is supported by the Koshland Scholarship.

Keywords

Arthur-Merlin games
Derandomization

ASJC Scopus subject areas

Theoretical Computer Science
General Mathematics
Computational Theory and Mathematics
Computational Mathematics

Access to Document

10.1007/s00037-003-0178-7

Cite this

@article{19713f8a88454da6b4d8e4e53ff832bd,

title = "Uniform hardness versus randomness tradeoffs for Arthur-Merlin games",

abstract = "Impagliazzo and Wigderson proved a uniform hardness vs. randomness {"}gap theorem{"} for BPP. We show an analogous result for AM: Either Arthur-Merlin protocols are very strong and everything in E = DTIME(2 O(n)) can be proved to a subexponential time verifier, or else Arthur-Merlin protocols are weak and every language in AM has a polynomial time nondeterministic algorithm such that it is infeasible to come up with inputs on which the algorithm fails. We also show that if Arthur-Merlin protocols are not very strong (in the sense explained above) then AM ∩ coAM = NP ∩ coNP. Our technique combines the nonuniform hardness versus randomness tradeoff of Miltersen and Vinodchandran with {"}instance checking{"}. A key ingredient in our proof is identifying a novel {"}resilience{"} property of hardness vs. randomness tradeoffs.",

keywords = "Arthur-Merlin games, Derandomization",

author = "Dan Gutfreund and Ronen Shaltiel and Amnon Ta-Shma",

note = "Funding Information: The first author is supported in part by the Leibniz Center, the Israel Foundation of Science, a US-Israel Binational research grant, and an EU Information Technologies grant (IST-FP5). The second author is supported by the Koshland Scholarship.",

year = "2003",

doi = "10.1007/s00037-003-0178-7",

language = "English",

volume = "12",

pages = "85--130",

journal = "Computational Complexity",

issn = "1016-3328",

publisher = "Birkhauser Verlag Basel",

number = "3-4",

}

TY - JOUR

T1 - Uniform hardness versus randomness tradeoffs for Arthur-Merlin games

AU - Gutfreund, Dan

AU - Shaltiel, Ronen

AU - Ta-Shma, Amnon

N1 - Funding Information: The first author is supported in part by the Leibniz Center, the Israel Foundation of Science, a US-Israel Binational research grant, and an EU Information Technologies grant (IST-FP5). The second author is supported by the Koshland Scholarship.

PY - 2003

Y1 - 2003

N2 - Impagliazzo and Wigderson proved a uniform hardness vs. randomness "gap theorem" for BPP. We show an analogous result for AM: Either Arthur-Merlin protocols are very strong and everything in E = DTIME(2 O(n)) can be proved to a subexponential time verifier, or else Arthur-Merlin protocols are weak and every language in AM has a polynomial time nondeterministic algorithm such that it is infeasible to come up with inputs on which the algorithm fails. We also show that if Arthur-Merlin protocols are not very strong (in the sense explained above) then AM ∩ coAM = NP ∩ coNP. Our technique combines the nonuniform hardness versus randomness tradeoff of Miltersen and Vinodchandran with "instance checking". A key ingredient in our proof is identifying a novel "resilience" property of hardness vs. randomness tradeoffs.

AB - Impagliazzo and Wigderson proved a uniform hardness vs. randomness "gap theorem" for BPP. We show an analogous result for AM: Either Arthur-Merlin protocols are very strong and everything in E = DTIME(2 O(n)) can be proved to a subexponential time verifier, or else Arthur-Merlin protocols are weak and every language in AM has a polynomial time nondeterministic algorithm such that it is infeasible to come up with inputs on which the algorithm fails. We also show that if Arthur-Merlin protocols are not very strong (in the sense explained above) then AM ∩ coAM = NP ∩ coNP. Our technique combines the nonuniform hardness versus randomness tradeoff of Miltersen and Vinodchandran with "instance checking". A key ingredient in our proof is identifying a novel "resilience" property of hardness vs. randomness tradeoffs.

KW - Arthur-Merlin games

KW - Derandomization

UR - http://www.scopus.com/inward/record.url?scp=4744337602&partnerID=8YFLogxK

U2 - 10.1007/s00037-003-0178-7

DO - 10.1007/s00037-003-0178-7

M3 - Article

AN - SCOPUS:4744337602

SN - 1016-3328

VL - 12

SP - 85

EP - 130

JO - Computational Complexity

JF - Computational Complexity

IS - 3-4

ER -

Uniform hardness versus randomness tradeoffs for Arthur-Merlin games

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this