Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Vehicular clouds are formed by incorporating cloud-based services into vehicular ad hoc networks. Amongst the several challenges… 
2010
2010
Using yearly budget data from Kenyan local governments from 2002-2007 and electoral data from 2007, we find evidence of electoral… 
2010
2010
In this paper we present the static manycast routing and wavelength assignment (MA-RWA) problem along with heuristics and an… 
2009
2009
The radio emitting X-ray binary GRS 1915+105 shows a wide variety of X-ray and radio states. We present a decade of monitoring… 
2007
2007
Memetic algorithms usually employ long running times, since local search is performed every time a new solution is generated… 
2003
2003
  • P. A. Abetti
  • 2003
  • Corpus ID: 70585240
In this paper we utilize case analysis to determine the actual level of management by executives and the consequences of over… 
Highly Cited
2002
Highly Cited
2002
  • H. Klauck
  • 2002
  • Corpus ID: 1007
We investigate the power of the most important lower bound technique in randomized communication complexity, which is based on an… 
1999
1999
The purpose of this study was to assess the effectiveness of two generative learning strategies, concept maps and manipulation of… 
1998
1998
It is well known that probabilistic boolean decision trees cannot be much more powerful than deterministic ones. Motivated by a… 
1996
1996
Road surface roughness is an important measure of road condition. This report provides a detailed description of the Merlin…