A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is
We introduce and study a new model of interactive proofs: AM (k), or Arthur-Merlin with k non-communicating Merlins. ... More generally, we show that multiple Merlins never provide more than a polynomial advantage over one: that is, AM (k) = AM for all k = poly (n). ... AM (k) should not be confused with AM [k], which means AM with a single Merlin but k rounds of communication. ...doi:10.1109/ccc.2014.13 dblp:conf/coco/AaronsonIM14 fatcat:y355gowisfdzpfnpnjr7unvzz4
We introduce and study a new model of interactive proofs: AM(k), or Arthur-Merlin with k non-communicating Merlins. ... More generally, we show that multiple Merlins never provide more than a polynomial advantage over one: that is, AM(k)=AM for all k=poly(n). ... AM (k) should not be confused with AM [k], which means AM with a single Merlin but k rounds of communication. ...arXiv:1401.6848v1 fatcat:t2kgxekbpvgvvf66emxcrvautm
In this commentary, the author, a long-term cancer survivor, reflects on his recent experiences with heart disease and discusses how he has benefited from advances in communication technologies in his ... As far as I am personally concerned, I am not sure what other illnesses are in store for me in the future. ... multiple wires connected to the heart. ...doi:10.1093/jncimonographs/lgt022 pmid:24395997 pmcid:PMC3895959 fatcat:5mifwdl3xzhv7jfy37zwv3xaa4
The GMR system uses private coin tosses whereas in the Arthur-Merlin proof system, coin tosses are public. In this paper we give an exposition of the Arthur-Merlin system. ... = AM. ... ACKNOWLEDGMENTS The "simple observation" that AM =almost-NP appears without proof as Proposition 2S(ii) in [Ball. ...doi:10.1016/0022-0000(88)90028-1 fatcat:bk5hhwocr5cdvptb7ica3xkb6m
In fact, we obtain an equivalence for a mild notion of derandomization: Arthur-Merlin games can be simulated in Σ2SUBEXP (the subexponential version of Σ2P) with subpolynomial advice on infinitely many ... Hardness against nondeterministic circuits is known to suffice for derandomizing Arthur-Merlin games. ... Moreover, in parallel to the AM-protocol, we make sure C commits Merlin to a fixed strategy. ...doi:10.1109/ccc.2012.32 dblp:conf/coco/AydinliogluM12 fatcat:b4dgncxwyrhgrmziowvmkssihm
Two variance-components approaches (SOLAR and MERLIN-VC) and one regression method (MERLIN-REGRESS) were applied to the data. ... Results: Evidence for linkage to BMI was found on chromosomes 16 and 6 with maximum LOD scores of 3.2 and 2.7, respectively. ... Acknowledgments The Framingham Heart Study is conducted and supported by the National Heart, Lung, and Blood Institute (NHLBI) in collaboration with Boston University. ...doi:10.1186/1471-2156-4-s1-s91 pmid:14975159 pmcid:PMC1866532 fatcat:3smy4zdpqvhtdaikx4kgjcsl3e
As a consequence we obtain gap theorems for AM (and AM ∩ coAM) that state, roughly, that either AM (or AM ∩ coAM) protocols running in time t(n) can simulate all of EXP ("Arthur-Merlin games are powerful ... "), or else all of AM (or AM ∩ coAM) can be simulated in nondeterministic time s(n) ("Arthur-Merlin games can be derandomized"), for a near-optimal relationship between t(n) and s(n). ... ∩ coAM gives the same result with "AM" replaced by "AM ∩ coAM." ...doi:10.1145/1250790.1250854 dblp:conf/stoc/ShaltielU07 fatcat:rubsqhu67najncnqaetyywxj44
Merlin, D., C. L. Laboisse, and U. Hopfer. ... Multiple modes of regulation of airway epithelial chloride secretion by extracellu- lar ATP. Am. J. Physiol. 267 (Cell Physiol. 36): C1442—C1451, 1994. . Tamaoki, T., H. Nomoto, I. Takahashi, Y. ...
Modernity, though, is not the first period to refashion Merlin and his knowledge in its own terms and interests: Merlin and his knowledge have multiple and conflicted meanings, developed and varied over ... Merlin's beard, wand, and pointy hat are recent phenomena with recent meaning: through those motifs the figure who possesses knowledge is deprived of both normality and vigor, made pointy-headed to match ... texts and assembling reference materials on the Arthur myth with much on the international Merlin. ...doi:10.7591/9781501732928-002 fatcat:fozpteihdvcqfpl6yoo3ut5j4y
Drainage of a single large lake, rather than multiple lakes, would have been suffi cient to have formed the scablands. -BH Geol. Soc. Am. Bull. 122, 678 (2010) . ... Endogenous Merlin was observed in the nucleus of multiple cell types by virtue of its binding to an E3 ubiquitin ligase, CRL4DCAF1. ...doi:10.1126/science.327.5972.1430-d fatcat:gcjqoyz6ffdlfgx4fe2gcbpi4m
Drainage of a single large lake, rather than multiple lakes, would have been suffi cient to have formed the scablands. -BH Geol. Soc. Am. Bull. 122, 678 (2010) . ... Endogenous Merlin was observed in the nucleus of multiple cell types by virtue of its binding to an E3 ubiquitin ligase, CRL4DCAF1. ...doi:10.1126/science.2010.327.5972.twil fatcat:mx7w3ipksne4dl45an7s3prgea
SIPs, and provides a new characterization of (non-online) Arthur-Merlin communication in terms of an online model. ... Such efficiency with O(1) rounds of interaction was thought to be impossible based on previous work. ... improvements, if interaction with Merlin is not permitted. ...doi:10.4230/lipics.ccc.2015.217 dblp:conf/coco/ChakrabartiCMTV15 fatcat:eyseeegx6zehjjjhf3tie26nxe
Our main result, which applies to the equivalent form of IP known as Arthur-Merlin (AM) games, is a randomness-e cient technique for decreasing the error probability. ... Given an AM proof system for L which achieves error probability 1=3 at the cost of Arthur sending l(n) random bits per round, and given a polynomial k = k(n), we show how to construct an AM proof system ... Given a 2g(n) round AM proof system for L in which Arthur sends l(n) random bits per round an Merlin responds with a q(n) bit string, they show how to construct a g(n) round AM proof system for L in which ...doi:10.1007/bf01275487 fatcat:vmuutgpx6fgb5i4amja5uq6j5q
The corresponding class is denoted AM. ... Then it is shown how Arthur may reveal his moves ahead of time with Merlin being unable to gain any advantage from having this knowledge. ...
Arthur-Merlin Communication Protocols and Faster Satisfying-Pair Algorithms. ... Our second connection is that a fast AM cc protocol for a function f implies a faster-thanbruteforce algorithm for f -Satisfying-Pair. ... matrix multiplication. ...doi:10.4230/lipics.itcs.2019.23 dblp:conf/innovations/ChenW19 fatcat:vmh4bsetmjd7fiimu42psn74ge
« Previous Showing results 1 — 15 out of 5,155 results