Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Arthur–Merlin protocol

Known as: AM (complexity), MA (complexity), CoAM 
In computational complexity theory, an Arthur–Merlin protocol is an interactive proof system in which the verifier's coin tosses are constrained to… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
Despite recent reports of high power conversion efficiency (PCE) values of over 20%, the instability of perovskite solar cells… Expand
Is this relevant?
Highly Cited
2016
Highly Cited
2016
As a follow-on work of the authors’ theoretical study, the paper presented an experimental investigation into the energy… Expand
  • figure 3
  • table 1
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Abstract We place the geological history since Cretaceous times in western Turkey in a context of convergence, subduction… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
In this paper, we present a multi-surrogates assisted memetic algorithm for solving optimization problems with computationally… Expand
  • figure 2
  • figure 3
  • figure 4
  • table 1
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We show that for each k> 0, MA/ 1( MA with 1 bit of advice) does not have circuits of size n k . This implies the first… Expand
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Abstract.We initiate the study of the computational complexity of the covering radius problem for lattices, and approximation… Expand
  • figure 1.1
  • figure 1.2
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We establish hardness versus randomness trade-offs for a broad class of randomized procedures. In particular, we create efficient… Expand
  • table 1
  • table 2
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We show that the shortest vector problem in lattices with La norm is NP-hard for randomized reductions. Moreover we also show… Expand
Is this relevant?
Highly Cited
1996
Highly Cited
1996
For many applications, a randomized algorithm is either the simplest or the fastest algorithm available, and sometimes both. This… Expand
Is this relevant?
Highly Cited
1988
Highly Cited
1988
 
Is this relevant?