# Arthur–Merlin protocol

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2014

2014

- Conference on Computational Complexity
- 2014

In the setting of streaming interactive proofs (SIPs), a client (verifier) needs to compute a given function on a massive stream… (More)

Is this relevant?

2014

2014

- ITCS
- 2014

We study whether information complexity can be used to attack the long-standing open problem of proving lower bounds against… (More)

Is this relevant?

2014

2014

- 2014

In several settings derandomization is known to follow from circuit lower bounds that themselves are equivalent to the existence… (More)

Is this relevant?

2013

2013

- Electronic Colloquium on Computational Complexity
- 2013

We study the power of Arthur-Merlin probabilistic proof systems in the data stream model. We show a canonical AM streaming… (More)

Is this relevant?

2012

2012

- computational complexity
- 2012

In several settings, derandomization is known to follow from circuit lower bounds that themselves are equivalent to the existence… (More)

Is this relevant?

2010

2010

- 2010

Probabilistically Checkable Proofs (PCPs) are an important class of proof systems that have played a key role in computational… (More)

Is this relevant?

2009

2009

- TCC
- 2009

The concept of witness-hiding suggested by Feige and Shamir is a natural relaxation of zero-knowledge. In this paper we identify… (More)

Is this relevant?

2007

2007

- STOC
- 2007

We show a parallel-repetition theorem for constant-round Arthur-Merlin Games, using an efficient reduction. As a consequence, we… (More)

Is this relevant?

2007

2007

- STOC
- 2007

We show that for each k > 0, MA/1 (MA with 1 bit of advice) doesn’t have circuits of size n. This implies the first superlinear… (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- STOC
- 1997

We show that the shortest vector problem in lattices with La norm is NP-hard for randomized reductions. Moreover we also show… (More)

Is this relevant?