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)

Related topics

Related topics

24 relations
AI-completeAdvice (complexity)Alice and BobBPP (complexity)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Dynamic Virtual Machine Migration in a vehicular cloud
Vehicular clouds are formed by incorporating cloud-based services into vehicular ad hoc networks. Amongst the several challenges… 
2010
2010
Budget Management and Accountability : Evidence from Kenyan Local Authorities
Using yearly budget data from Kenyan local governments from 2002-2007 and electoral data from 2007, we find evidence of electoral… 
2010
2010
Routing and Wavelength Assignment of Static Manycast Demands Over All-Optical Wavelength-Routed WDM Networks
In this paper we present the static manycast routing and wavelength assignment (MA-RWA) problem along with heuristics and an… 
2009
2009
A decade of high-resolution radio observations of GRS 1915+105
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
Accelerating Local Search in a Memetic Algorithm for the Capacitated Vehicle Routing Problem
Memetic algorithms usually employ long running times, since local search is performed every time a new solution is generated… 
2006
2006
Micromorph Solar Cell Optimization using a ZnO Layer as Intermediate Reflector
The insertion of a zinc oxide (ZnO) intermediate reflector (ZIR) between the top and bottom cell of a superstrate (p-i-n/p-i-n… 
2003
2003
Over-managing and under-managing radical technological innovations: lessons from USA, Japan, and Europe
  • P. A. Abetti
  • IEMC '03 Proceedings. Managing Technologically…
  • 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
Rectangle size bounds and threshold covers in communication complexity
  • H. Klauck
  • 18th IEEE Annual Conference on Computational…
  • 2002
  • Corpus ID: 1007
We investigate the power of the most important lower bound technique in randomized communication complexity, which is based on an… 
1998
1998
Arthur-Merlin games in Boolean decision trees
It is well known that probabilistic boolean decision trees cannot be much more powerful than deterministic ones. Motivated by a… 
1996
1996
THE MERLIN ROAD ROUGHNESS MACHINE: USER GUIDE
Road surface roughness is an important measure of road condition. This report provides a detailed description of the Merlin… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)