Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,232,303 papers from all fields of science
Search
Sign In
Create Free Account
Arthur–Merlin protocol
Known as:
AM (complexity)
, MA (complexity)
, CoAM
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
24 relations
AI-complete
Advice (complexity)
Alice and Bob
BPP (complexity)
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Dynamic Virtual Machine Migration in a vehicular cloud
T. Refaat
,
B. Kantarci
,
Hussein Mouftah
International Symposium on Computers and…
2014
Corpus ID: 5549365
Vehicular clouds are formed by incorporating cloud-based services into vehicular ad hoc networks. Amongst the several challenges…
Expand
2010
2010
Budget Management and Accountability : Evidence from Kenyan Local Authorities
Nicole Bonoff
,
B. Zimmerman
2010
Corpus ID: 17378005
Using yearly budget data from Kenyan local governments from 2002-2007 and electoral data from 2007, we find evidence of electoral…
Expand
2010
2010
Routing and Wavelength Assignment of Static Manycast Demands Over All-Optical Wavelength-Routed WDM Networks
N. Charbonneau
,
V. Vokkarane
IEEE\/OSA Journal of Optical Communications and…
2010
Corpus ID: 6498917
In this paper we present the static manycast routing and wavelength assignment (MA-RWA) problem along with heuristics and an…
Expand
2009
2009
A decade of high-resolution radio observations of GRS 1915+105
A. Rushton
,
Ralph Spencer
,
G. Pooley
,
S. Trushkin
2009
Corpus ID: 118410460
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…
Expand
2007
2007
Accelerating Local Search in a Memetic Algorithm for the Capacitated Vehicle Routing Problem
M. Kubiak
,
Przemyslaw Wesolek
EvoCOP
2007
Corpus ID: 199091
Memetic algorithms usually employ long running times, since local search is performed every time a new solution is generated…
Expand
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…
Expand
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…
Expand
1999
1999
Comparison of Generative Learning Strategies.
Christian Volk
,
Donn Ritchie
1999
Corpus ID: 56267961
The purpose of this study was to assess the effectiveness of two generative learning strategies, concept maps and manipulation of…
Expand
1998
1998
Arthur-Merlin games in Boolean decision trees
R. Raz
,
G. Tardos
,
O. Verbitsky
,
N. Vereshchagin
Proceedings. Thirteenth Annual IEEE Conference on…
1998
Corpus ID: 3178655
It is well known that probabilistic boolean decision trees cannot be much more powerful than deterministic ones. Motivated by a…
Expand
1996
1996
THE MERLIN ROAD ROUGHNESS MACHINE: USER GUIDE
M. Cundill
1996
Corpus ID: 106854989
Road surface roughness is an important measure of road condition. This report provides a detailed description of the Merlin…
Expand
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)
ACCEPT & CONTINUE