Relevant bibliographies by topics / Arthur-Merlin

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Arthur-Merlin'

Author: Grafiati
Published: 4 June 2021
Last updated: 6 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Arthur-Merlin.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Arthur-Merlin"

1

Santha, Miklos. "Relativized Arthur-Merlin versus Merlin-Arthur games." Information and Computation 80, no. 1 (1989): 44–49. http://dx.doi.org/10.1016/0890-5401(89)90022-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Morimae, Tomoyuki, Masahito Hayashi, Harumichi Nishimura, and Keisuke Fujii. "Quantum Merlin-Arthur with Clifford Arthur." Quantum Information and Computation 15, no. 15&16 (2015): 1420–30. http://dx.doi.org/10.26421/qic15.15-16-10.

Full text
Abstract:
We show that the class QMA does not change even if we restrict Arthur’s computing ability to only Clifford gate operations (plus classical XOR gate). The idea is to use the fact that the preparation of certain single-qubit states, so called magic states, plus any Clifford gate operations are universal for quantum computing. If Merlin is honest, he sends the witness plus magic states to Arthur. If Merlin is malicious, he might send other states to Arthur, but Arthur can verify the correctness of magic states by himself. We also generalize the result to QIP(3): we show that the class QIP(3) does
APA, Harvard, Vancouver, ISO, and other styles
3

Marriott, Chris, and John Watrous. "Quantum Arthur–Merlin games." computational complexity 14, no. 2 (2005): 122–52. http://dx.doi.org/10.1007/s00037-005-0194-x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Gur, Tom, and Ran Raz. "Arthur–Merlin streaming complexity." Information and Computation 243 (August 2015): 145–65. http://dx.doi.org/10.1016/j.ic.2014.12.011.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

CAI, JIN-YI, DENIS CHARLES, A. PAVAN, and SAMIK SENGUPTA. "ON HIGHER ARTHUR-MERLIN CLASSES." International Journal of Foundations of Computer Science 15, no. 01 (2004): 3–19. http://dx.doi.org/10.1142/s0129054104002273.

Full text
Abstract:
We study higher Arthur-Merlin classes defined via several natural probabilistic operators BP, R and coR. We investigate the complexity classes they define, and a number of interactions between these operators and the standard polynomial time hierarchy. We prove a hierarchy theorem for these higher Arthur-Merlin classes involving interleaving operators, and a theorem giving non-trivial upper bounds to the intersection of the complementary classes in the hierarchy.
APA, Harvard, Vancouver, ISO, and other styles
6

VINODCHANDRAN, N. V. "NONDETERMINISTIC CIRCUIT MINIMIZATION PROBLEM AND DERANDOMIZING ARTHUR-MERLIN GAMES." International Journal of Foundations of Computer Science 16, no. 06 (2005): 1297–308. http://dx.doi.org/10.1142/s0129054105003819.

Full text
Abstract:
We investigate the complexity of strong nondeterministic circuit minimization problem (SNCMP in short) in relation to derandomizing Arthur-Merlin games. We show derandomization results for Arthur-Merlin games under both easiness and hardness assumptions about the complexity of SNCMP. Assuming SNCMP is non-uniformly easy, we present derandomization of Arthur-Merlin games using weaker hardness assumptions than what is currently known. On the other hand, we show that establishing SNCMP is hard for SAT or Graph Isomorphism problem under certain natural reductions will show that Graph Nonisomorphis
APA, Harvard, Vancouver, ISO, and other styles
7

Kobayashi, Hirotada, François Le Gall, and Harumichi Nishimura. "Generalized Quantum Arthur--Merlin Games." SIAM Journal on Computing 48, no. 3 (2019): 865–902. http://dx.doi.org/10.1137/17m1160173.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Chakaravarthy, Venkatesan T., and Sambuddha Roy. "Arthur and Merlin as Oracles." computational complexity 20, no. 3 (2011): 505–58. http://dx.doi.org/10.1007/s00037-011-0015-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Watson, Thomas. "Quadratic Simulations of Merlin–Arthur Games." ACM Transactions on Computation Theory 12, no. 2 (2020): 1–11. http://dx.doi.org/10.1145/3389399.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Santhanam, Rahul. "Circuit Lower Bounds for Merlin–Arthur Classes." SIAM Journal on Computing 39, no. 3 (2009): 1038–61. http://dx.doi.org/10.1137/070702680.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Arthur-Merlin"

1

Drucker, Andrew Donald. "PCPs for Arthur-Merlin games and communication protocols." Thesis, Massachusetts Institute of Technology, 2010. http://hdl.handle.net/1721.1/60160.

Full text
Abstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010.<br>Includes bibliographical references (p. 59-62).<br>Probabilistically Checkable Proofs (PCPs) are an important class of proof systems that have played a key role in computational complexity theory. In this thesis we study the power of PCPs in two new settings: Arthur-Merlin games and communication protocols. In the first part of the thesis, we give a 'PCP characterization' of AM analogous to the PCP Theorem for NP. Similar characterizations have been given for higher levels of th
APA, Harvard, Vancouver, ISO, and other styles
2

Cretoiu, Elena. "La Suite du Roman de Merlin éditée d'après un manuscrit du XVe siècle : (Paris, BNF, fr. 112)." Thesis, Strasbourg, 2014. http://www.theses.fr/2014STRAC001.

Full text
Abstract:
Le fragment de la Suite du Roman de Merlin que nous éditons est conservé dans quatre manuscrits (ms. de Londres, British Library, Additional 38117, le ms. Cambridge University Library, Additional 7071, le ms. de la Bibilothèque Nationale de France, fr. 112 - ms. de base de notre édition, et le ms. d'Imola, Biblioteca Comunale, ms. 135 AA25 n o 9 (7)). Par rapport aux trois éditions de la Suite déjà existantes (O. Sommer, Die Abenteuer Gawains Ywains und Le Morholts mit Den Drei Jungfrauen (Zeitschrift für Romanische Philologie, Beiheft 47, 1913), P. C. Smith (Les enchantemenz de Bretagne, Chap
APA, Harvard, Vancouver, ISO, and other styles
3

Santha, Miklos. "Contributions à l'étude des structures aléatoires et des méthodes probabilistes." Paris 11, 1988. http://www.theses.fr/1988PA112057.

Full text
Abstract:
Cette thèse contient quelques contributions à l'étude des structures aléatoires et des méthodes probabilistes en informatique théorique. Certaines d'entre elles étudient les séquences aléatoires et les classes de complexité probabilistes, d'autres traitent des problèmes concrets. Nous introduisons un nouveau modèle mathématique des sources physiques aléatoires imparfaites et nous montrons comment transformer la sortie de ces sources en séquences quasi-aléatoires qu'on ne peut pas distinguer, dans un sens très fort, des séquences parfaitement aléatoires. Nous démontrons l'existence des générate
APA, Harvard, Vancouver, ISO, and other styles
4

Chardonnens, Noémie. "L'autre du même : emprunts et répétitions dans le Roman de Perceforest." Thesis, Paris 3, 2014. http://www.theses.fr/2014PA030066.

Full text
Abstract:
Issu de la fin du Moyen Âge, le Roman de Perceforest est la plus longue œuvre que le Moyen Âge nous ait laissé. Il entend décrire la vie des ancêtres préchrétiens d’Arthur et de ses chevaliers en les faisant descendre d’Alexandre le Grand. Au fil de son récit, l’auteur met en place une véritable poétique de la reprise, tant externe qu’interne. Il multiplie les références à des textes préexistants issus de différentes matières et va même jusqu’à en intégrer des morceaux entiers. Il reprend par ailleurs des morceaux de sa propre œuvre, n’hésitant pas à reproduire des schémas, voire des séquences
APA, Harvard, Vancouver, ISO, and other styles
5

Bacon, Edwin Bruce. "Confronting eternity : strange (im)mortalities, and states of undying in popular fiction." Thesis, University of Canterbury. English, 2014. http://hdl.handle.net/10092/9680.

Full text
Abstract:
When the meritless scrabble for the bauble of deity, they ironically set their human lives at the “pin’s fee” to which Shakespeare’s Hamlet refers. This thesis focuses on these undeserving individuals in premillennial and postmillennial fiction, who seek immortality at the expense of both their humanities, and their natural mortalities. I will analyse an array of popular modern characters, paying particular attention to the precursors of immortal personages. I will inaugurate these analyses with an examination of fan favourite series
APA, Harvard, Vancouver, ISO, and other styles
6

Blier, Hugue. "Preuves interactives classiques." Thèse, 2006. http://hdl.handle.net/1866/16728.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Blier, Hugue. "Preuves interactives quantiques." Thèse, 2009. http://hdl.handle.net/1866/3567.

Full text
Abstract:
Cette thèse est consacrée à la complexité basée sur le paradigme des preuves interactives. Les classes ainsi définies ont toutes en commun qu’un ou plusieurs prouveurs, infiniment puissants, tentent de convaincre un vérificateur, de puissance bornée, de l’appartenance d’un mot à un langage. Nous abordons ici le modèle classique, où les participants sont des machines de Turing, et le modèle quantique, où ceux-ci sont des circuits quantiques. La revue de littérature que comprend cette thèse s’adresse à un lecteur déjà familier avec la complexité et l’informatique quantique. Cette thèse présente
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Arthur-Merlin"

1

Thouard, Jean-Louis, and Viviane Koenig. La légende de Merlin l'enchanteur et du roi Arthur. La Martinière jeunesse, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bruchési, Louise. Viens voir Merlin (légende du Roi Arthur): Hamlet (exercices). Théâtre d'art du Québec, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Names from the dawn of British legend: Taliesin, Aneirin, Myrddin/Merlin, Arthur. Llanerch Publishers, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Yolen, Jane. Merlin and the dragons. Cobblehill Books, Dutton, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Spinner, Stephanie. The magic of Merlin. Golden Books, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Yolen, Jane. The dragon's boy. Harper & Row, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Thomas, Malory. The Book Of Merlin, The Book Of Sir Balin From Malory's King Arthur With Caxton's Preface. Kessinger Publishing, LLC, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Thomas, Malory. The Book Of Merlin, The Book Of Sir Balin From Malory's King Arthur With Caxton's Preface. Kessinger Publishing, LLC, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Blair, J. M. C. The Pendragon murders: A Merlin investigation. Berkley Pub. Group, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Mary, Stewart. The hollow hills. Eos, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Arthur-Merlin"

1

Santha, Miklos. "Relativized Arthur-Merlin versus Merlin-Arthur games." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/3-540-18625-5_66.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Gur, Tom, and Ran Raz. "Arthur-Merlin Streaming Complexity." In Automata, Languages, and Programming. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-39206-1_45.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Cai, Jin-Yi, Denis Charles, A. Pavan, and Samik Sengupta. "On Higher Arthur-Merlin Classes." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45655-4_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Watson, Thomas. "Quadratic Simulations of Merlin–Arthur Games." In LATIN 2018: Theoretical Informatics. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-77404-6_62.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Fraigniaud, Pierre, Pedro Montealegre, Rotem Oshman, Ivan Rapaport, and Ioan Todinca. "On Distributed Merlin-Arthur Decision Protocols." In Structural Information and Communication Complexity. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-24922-9_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Lu, Chi-Jen. "Derandomizing Arthur-Merlin Games under Uniform Assumptions." In Algorithms and Computation. Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-40996-3_26.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Diehl, Scott. "Lower Bounds for Swapping Arthur and Merlin." In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-74208-1_33.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Selvam, Vyas Ram. "The Two Queries Assumption and Arthur-Merlin Classes." In Mathematical Foundations of Computer Science 2014. Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-44465-8_51.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kobayashi, Hirotada, Keiji Matsumoto, and Tomoyuki Yamakami. "Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?" In Algorithms and Computation. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-24587-2_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Torán, Jacobo. "Arthur-Merlin Games and the Problem of Isomorphism Testing." In New Computational Paradigms. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11494645_61.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Arthur-Merlin"

1

Klauck, Hartmut. "On Arthur Merlin Games in Communication Complexity." In 2011 IEEE Annual Conference on Computational Complexity (CCC). IEEE, 2011. http://dx.doi.org/10.1109/ccc.2011.33.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Santhanam, Rahul. "Circuit lower bounds for Merlin-Arthur classes." In the thirty-ninth annual ACM symposium. ACM Press, 2007. http://dx.doi.org/10.1145/1250790.1250832.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Pass, Rafael, and Muthuramakrishnan Venkitasubramaniam. "An efficient parallel repetition theorem for Arthur-Merlin games." In the thirty-ninth annual ACM symposium. ACM Press, 2007. http://dx.doi.org/10.1145/1250790.1250853.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Göös, Mika, Toniann Pitassi, and Thomas Watson. "Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication." In ITCS'15: Innovations in Theoretical Computer Science. ACM, 2015. http://dx.doi.org/10.1145/2688073.2688074.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Aydinlioglu, Baris, and Dieter van Melkebeek. "Nondeterministic Circuit Lower Bounds from Mildly De-randomizing Arthur-Merlin Games." In 2012 IEEE Conference on Computational Complexity (CCC). IEEE, 2012. http://dx.doi.org/10.1109/ccc.2012.32.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Gutfreund, Dan, and Akinori Kawachi. "Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds." In 2010 IEEE 25th Annual Conference on Computational Complexity (CCC). IEEE, 2010. http://dx.doi.org/10.1109/ccc.2010.13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Harrow, Aram W., and Ashley Montanaro. "An Efficient Test for Product States with Applications to Quantum Merlin-Arthur Games." In 2010 IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2010. http://dx.doi.org/10.1109/focs.2010.66.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography