Academic literature on the topic 'Arthur-Merlin'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
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"
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 textMorimae, 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 textMarriott, 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 textGur, 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 textCAI, 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 textVINODCHANDRAN, 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 textKobayashi, 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 textChakaravarthy, 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 textWatson, 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 textSanthanam, 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 textDissertations / Theses on the topic "Arthur-Merlin"
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 textCretoiu, 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 textSantha, Miklos. "Contributions à l'étude des structures aléatoires et des méthodes probabilistes." Paris 11, 1988. http://www.theses.fr/1988PA112057.
Full textChardonnens, 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 textBacon, 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 textBlier, Hugue. "Preuves interactives classiques." Thèse, 2006. http://hdl.handle.net/1866/16728.
Full textBlier, Hugue. "Preuves interactives quantiques." Thèse, 2009. http://hdl.handle.net/1866/3567.
Full textBooks on the topic "Arthur-Merlin"
Thouard, Jean-Louis, and Viviane Koenig. La légende de Merlin l'enchanteur et du roi Arthur. La Martinière jeunesse, 2009.
Find full textBruchési, Louise. Viens voir Merlin (légende du Roi Arthur): Hamlet (exercices). Théâtre d'art du Québec, 2011.
Find full textNames from the dawn of British legend: Taliesin, Aneirin, Myrddin/Merlin, Arthur. Llanerch Publishers, 1994.
Find full textThomas, 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 textThomas, 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 textBlair, J. M. C. The Pendragon murders: A Merlin investigation. Berkley Pub. Group, 2010.
Find full textBook chapters on the topic "Arthur-Merlin"
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 textGur, 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 textCai, 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 textWatson, 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 textFraigniaud, 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 textLu, 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 textDiehl, 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 textSelvam, 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 textKobayashi, 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 textTorá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 textConference papers on the topic "Arthur-Merlin"
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 textSanthanam, 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 textPass, 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 textGöö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 textAydinlioglu, 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 textGutfreund, 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 textHarrow, 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