Journal articles: 'Arthur-Merlin'

1

Santha, Miklos. "Relativized Arthur-Merlin versus Merlin-Arthur games." Information and Computation 80, no. 1 (January 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 (November 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 not change even if the computational power of the verifier is restricted to only Clifford gate operations (plus classical XOR gate).

APA, Harvard, Vancouver, ISO, and other styles

3

Marriott, Chris, and John Watrous. "Quantum Arthur–Merlin games." computational complexity 14, no. 2 (June 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 (February 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 (December 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 Nonisomorphism problem has subexponential proofs of membership. We combine known constructions of pseudorandom and hitting set generators to prove our results.

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 (January 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 (August 5, 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 (May 14, 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 (January 2009): 1038–61. http://dx.doi.org/10.1137/070702680.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Chakrabarti, Amit, Graham Cormode, Andrew McGregor, Justin Thaler, and Suresh Venkatasubramanian. "Verifiable Stream Computation and Arthur--Merlin Communication." SIAM Journal on Computing 48, no. 4 (January 2019): 1265–99. http://dx.doi.org/10.1137/17m112289x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Lu, C. J. "Derandomizing Arthur--Merlin games under uniform assumptions." Computational Complexity 10, no. 3 (December 1, 2001): 247–59. http://dx.doi.org/10.1007/s00037-001-8196-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Miltersen, Peter Bro, and N. V. Vinodchandran. "Derandomizing Arthur–Merlin Games using Hitting Sets." computational complexity 14, no. 3 (December 2005): 256–79. http://dx.doi.org/10.1007/s00037-005-0197-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Raz, Ran, Gábor Tardos, Oleg Verbitsky, and Nikolai Vereshchagin. "Arthur–Merlin Games in Boolean Decision Trees." Journal of Computer and System Sciences 59, no. 2 (October 1999): 346–72. http://dx.doi.org/10.1006/jcss.1999.1654.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Kwadwo Adinkrah-Appiah, Atianashie Miracle A, Chukwuma Chinaza Adaobi, and Augustine Owusu-Addo. "Arthur pendragon Camelot evolution in merlin: A virtual fan art in the computation age." World Journal of Advanced Research and Reviews 11, no. 2 (August 30, 2021): 040–47. http://dx.doi.org/10.30574/wjarr.2021.11.2.0340.

Full text

Abstract:

This paper inspects Arthur Pendragon Camelot evolution in Merlin, the research review on the Citadel of Camelot, Camelot Administration, Knights of Camelot, Early History of Camelot, The Intensification of The Once and Future King, Map of Camelot, and the Sovereignty of Arthur. Camelot Castle is the castle where the royal family live, and where the court is held. The citadel houses a garrison of at least 12,000 men and had never fallen in a siege before Morgause's invasion by her immortal army. It is currently the home of Guinevere Pendragon, the Queen of Camelot after her husband King Arthur Pendragon. In virtual fan art, Arthur Pendragon is shown to be a very wealthy kingdom as it offers a prize of a thousand gold coins for participation in its tournaments. Camelot is widely known for its laws banning all forms of magic and enchantments on penalty of death, usually by burning or beheading. However, the meter theater illustrates of Merlin who is Arthur's servant, secret protector, and best friend, and Gaius's ward and apprentice. Serves as an unofficial member of Arthur's Round Table and is a direct enemy of Mordred and Morgana. Waiting for Arthur to rise again. He is destined to protect Arthur so he can unite Albion under one high King.

APA, Harvard, Vancouver, ISO, and other styles

16

Göös, Mika, Toniann Pitassi, and Thomas Watson. "Zero-Information Protocols and Unambiguity in Arthur–Merlin Communication." Algorithmica 76, no. 3 (January 19, 2016): 684–719. http://dx.doi.org/10.1007/s00453-015-0104-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Beigi, S. "NP vs QMA_\log(2)." Quantum Information and Computation 10, no. 1&2 (January 2010): 141–51. http://dx.doi.org/10.26421/qic10.1-2-10.

Full text

Abstract:

Although it is believed unlikely that $\NP$-hard problems admit efficient quantum algorithms, it has been shown that a quantum verifier can solve NP-complete problems given a "short" quantum proof; more precisely, NP\subseteq QMA_{\log}(2) where QMA_{\log}(2) denotes the class of quantum Merlin-Arthur games in which there are two unentangled provers who send two logarithmic size quantum witnesses to the verifier. The inclusion NP\subseteq QMA_{\log}(2) has been proved by Blier and Tapp by stating a quantum Merlin-Arthur protocol for 3-coloring with perfect completeness and gap 1/24n^6. Moreover, Aaronson et al. have shown the above inclusion with a constant gap by considering $\widetilde{O}(\sqrt{n})$ witnesses of logarithmic size. However, we still do not know if QMA_{\log}(2) with a constant gap contains NP. In this paper, we show that 3-SAT admits a QMA_{\log}(2) protocol with the gap 1/n^{3+\epsilon}} for every constant \epsilon>0.

APA, Harvard, Vancouver, ISO, and other styles

18

Morimae, Tomoyuki, Yuki Takeuchi, and Harumichi Nishimura. "Merlin-Arthur with efficient quantum Merlin and quantum supremacy for the second level of the Fourier hierarchy." Quantum 2 (November 15, 2018): 106. http://dx.doi.org/10.22331/q-2018-11-15-106.

Full text

Abstract:

We introduce a simple sub-universal quantum computing model, which we call the Hadamard-classical circuit with one-qubit (HC1Q) model. It consists of a classical reversible circuit sandwiched by two layers of Hadamard gates, and therefore it is in the second level of the Fourier hierarchy. We show that output probability distributions of the HC1Q model cannot be classically efficiently sampled within a multiplicative error unless the polynomial-time hierarchy collapses to the second level. The proof technique is different from those used for previous sub-universal models, such as IQP, Boson Sampling, and DQC1, and therefore the technique itself might be useful for finding other sub-universal models that are hard to classically simulate. We also study the classical verification of quantum computing in the second level of the Fourier hierarchy. To this end, we define a promise problem, which we call the probability distribution distinguishability with maximum norm (PDD-Max). It is a promise problem to decide whether output probability distributions of two quantum circuits are far apart or close. We show that PDD-Max is BQP-complete, but if the two circuits are restricted to some types in the second level of the Fourier hierarchy, such as the HC1Q model or the IQP model, PDD-Max has a Merlin-Arthur system with quantum polynomial-time Merlin and classical probabilistic polynomial-time Arthur.

APA, Harvard, Vancouver, ISO, and other styles

19

Jordan, Stephen P., Hirotada Kobayashi, Daniel Nagaj, and Harumichi Nishimura. "Achieving perfect completeness in classical-witness quantum Merlin-Arthur proof systems." Quantum Information and Computation 12, no. 5&6 (May 2012): 461–71. http://dx.doi.org/10.26421/qic12.5-6-7.

Full text

Abstract:

This paper proves that classical-witness quantum Merlin-Arthur proof systems can achieve perfect completeness. That is, ${\QCMA = \QCMA_1}$. This holds under any gate set with which the Hadamard and arbitrary classical reversible transformations can be exactly implemented, \emph{e.g.}, ${\{\textrm{Hadamard, Toffoli, NOT}\}}$. The proof is quantumly nonrelativizing, and uses a simple but novel quantum technique that \emph{additively} adjusts the success probability, which may be of independent interest.

APA, Harvard, Vancouver, ISO, and other styles

20

Le Gall, Francois, Shota Nakagawa, and Harumichi Nishimura. "On QMA protocols with two short quantum proofs." Quantum Information and Computation 12, no. 7&8 (July 2012): 589–600. http://dx.doi.org/10.26421/qic12.7-8-4.

Full text

Abstract:

This paper gives a QMA (Quantum Merlin-Arthur) protocol for 3-SAT with two logarithmic-size quantum proofs (that are not entangled with each other) such that the gap between the completeness and the soundness is $\Omega(\frac{1}{n\polylog{n}})$. This improves the best completeness/soundness gaps known for NP-complete problems in this setting.

APA, Harvard, Vancouver, ISO, and other styles

21

Harrow, Aram W., and Ashley Montanaro. "Testing Product States, Quantum Merlin-Arthur Games and Tensor Optimization." Journal of the ACM 60, no. 1 (February 2013): 1–43. http://dx.doi.org/10.1145/2432622.2432625.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Pass, Rafael, and Muthuramakrishnan Venkitasubramaniam. "A Parallel Repetition Theorem for Constant-Round Arthur-Merlin Proofs." ACM Transactions on Computation Theory 4, no. 4 (November 2012): 1–22. http://dx.doi.org/10.1145/2382559.2382561.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Aydınlıoğlu, Barış, and Dieter van Melkebeek. "Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games." computational complexity 26, no. 1 (October 31, 2014): 79–118. http://dx.doi.org/10.1007/s00037-014-0095-y.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Nederlof, Jesper. "A short note on Merlin–Arthur protocols for subset sum." Information Processing Letters 118 (February 2017): 15–16. http://dx.doi.org/10.1016/j.ipl.2016.09.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Terhal, B. M., and D. P. DiVincenzo. "Adaptive Quantum Computation, Constant Depth Quantum Circuits and Arthur-Merlin Games." Quantum Information and Computation 4, no. 2 (March 2004): 134–45. http://dx.doi.org/10.26421/qic4.2-5.

Full text

Abstract:

We present evidence that there exist quantum computations that can be carried out in constant depth, using 2-qubit gates, that cannot be simulated classically with high accuracy. We prove that if one can simulate these circuits classically efficiently then ${\rm BQP} \subseteq {\rm AM}$.

APA, Harvard, Vancouver, ISO, and other styles

26

Dowling, M. R., and M. A. Nielsen. "The geometry of quantum computation." Quantum Information and Computation 8, no. 10 (November 2008): 861–99. http://dx.doi.org/10.26421/qic8.10-1.

Full text

Abstract:

Whether the class Quantum Merlin Arthur is equal to QMA_1, or QMA with one-sided error, has been an open problem for years. This note helps to explain why the problem is difficult, by using ideas from real analysis to give a quantum oracle relative to which QMA\neqQMA_1. As a byproduct, we find that there are facts about quantum complexity classes that are classically relativizing but not quantumly relativizing, among them such trivial containments as BQP\subseteq{ZQEXP}.

APA, Harvard, Vancouver, ISO, and other styles

27

Aaronson, S. "On perfect completeness for QMA." Quantum Information and Computation 9, no. 1&2 (January 2009): 81–89. http://dx.doi.org/10.26421/qic9.1-2-5.

Full text

Abstract:

Whether the class QMA (Quantum Merlin Arthur)\ is equal to QMA_1, or QMA with one-sided error, has been an open problem for years. This note helps to explain why the problem is difficult,\ by using ideas from real analysis to give a "quantum" relative to which QMA \neq QMA_1. As a byproduct, we find that there are facts about quantum complexity classes that are classically relativizing but not quantumly relativizing, among them such "trivial" containments as BQP \subseteq ZQEXP.

APA, Harvard, Vancouver, ISO, and other styles

28

Haller, Robert S. "Malory Meets Wagner in Madrid: Albéniz’s Merlin and the Mythologizing of Arthur." Ars Lyrica 15 (January 2006): 67–78. http://dx.doi.org/10.1484/j.jal.2.302707.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Applebaum, Benny, and Pavel Raykov. "From Private Simultaneous Messages to Zero-Information Arthur–Merlin Protocols and Back." Journal of Cryptology 30, no. 4 (July 18, 2016): 961–88. http://dx.doi.org/10.1007/s00145-016-9239-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Aydınlıog̃lu, Barış, Dan Gutfreund, John M. Hitchcock, and Akinori Kawachi. "Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds." computational complexity 20, no. 2 (June 2011): 329–66. http://dx.doi.org/10.1007/s00037-011-0010-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Breeze, Andrew. "Arthur, la mer et la guerre, ed. Alban Gautier, Marc Rolland, and Michelle Szkilnik. Rencontres 289: Série Civilisation médiévale, 26. Paris: Classiques Garnier, 2017, 345 pp." Mediaevistik 32, no. 1 (January 1, 2020): 283–84. http://dx.doi.org/10.3726/med.2019.01.28.

Full text

Abstract:

Fifteen essays in English or French, the actes of a colloque international at Boulogne in 2014, offer novel approaches to Arthur vis-à-vis war and the sea. Simon Esmonde-Cleary (after an introduction by the editors) relates these entities to the historical Arthur; Stéphane Lebecq then considers Celt and Saxon in the mers de l’Ouest of the Dark Ages. Alban Gautier informs us on early Anglo-Saxons and the sea; Krista Kapphahn discusses Celtic Otherworld voyages and the Irish Sea; Charlotte Wulf attends to Geoffrey of Monmouth and his contemporaries on Channel crossings. Michelle Szkilnik describes naval expeditions in French Arthurian verse romance. Frédérique Laget examines narratives of Arthur in the context of Wales and the March, with the legendary king coming to resemble Edward I as instigator of a colonizing imperialistic British state. Irène Fabry-Tehranchi discusses representations of Arthur’s wars and Channel crossings in manuscript illuminations for the Suite Vulgate of Merlin; Anne-Cécile Le Ribeuz-Koenig analyzes war and the sea in isaïe le Triste.

APA, Harvard, Vancouver, ISO, and other styles

32

Gruenbaum, Caroline. "The Quest for the “Charity Dish”: Interpretation in the Hebrew Arthurian Translation Melekh Artus (1279, Northern Italy)." Medieval Encounters 26, no. 6 (February 11, 2021): 517–42. http://dx.doi.org/10.1163/15700674-12340087.

Full text

Abstract:

Abstract This article analyzes Melekh Artus (King Arthur), a unique Hebrew translation of sections from the old French prose Merlin and mort Artu in the Lancelot-Grail cycle. Written in a single fragment from 1279 in northern Italy, this translation proves close Jewish engagement with old French texts. Through satirical biblical references and subtle critique of his material, the author reframes the Arthurian narrative to promote universal morals. Rather than Judaize the Arthurian canon and its Christian characters, he validates them as viable models for his Jewish audience.

APA, Harvard, Vancouver, ISO, and other styles

33

Merdrignac, Bernard. "Joseph d’Arimathie, Le Livre du Graal – Merlin – Les Premiers faits du roi Arthur." Annales de Bretagne et des pays de l'Ouest, no. 108-3 (September 20, 2001): 153–56. http://dx.doi.org/10.4000/abpo.1714.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Foster, Tara, and Jon Sherman. "King Arthur in the Twenty-First Century: Kaamelott, BBC’s Merlin, and Starz’s Camelot." Arthuriana 25, no. 1 (2015): 3–4. http://dx.doi.org/10.1353/art.2015.0007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Liskiewicz, M., and R. Reischuk. "On small space complexity classes of stochastic Turing machines and Arthur-Merlin-games." Computational Complexity 8, no. 3 (December 1, 1999): 273–307. http://dx.doi.org/10.1007/s000370050031.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Babai, László, and Shlomo Moran. "Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes." Journal of Computer and System Sciences 36, no. 2 (April 1988): 254–76. http://dx.doi.org/10.1016/0022-0000(88)90028-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Boyle, Louis J. "Ruled by Merlin: Mirrors for Princes, Counseling Patterns, and Malory’s ‘Tale of King Arthur’." Arthuriana 23, no. 2 (2013): 52–66. http://dx.doi.org/10.1353/art.2013.0021.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Fludernik, Monika. "Narrative Discourse Markers in Malory’s Morte D’Arthur." Journal of Historical Pragmatics 1, no. 2 (August 30, 2000): 231–62. http://dx.doi.org/10.1075/jhp.1.2.05flu.

Full text

Abstract:

On the basis of the model of narrative structure proposed in Fludernik (1996b) this paper presents the results of an investigation of discourse markers in Thomas Malory’s Morte D’Arthur, with a complete line-by-line analysis of The Tale of King Arthur, Books I to III (“Merlin”; “Balin”; “Torre and Pellinor”), A Noble Tale of Sir Launcelot du Lake, and The Book of Sir Tristram de Lyones (Book XIV: “Launcelot and Elaine”). The paper argues that the inflation of discourse markers in Malory is a sign of their imminent disappearance from narrative prose and that other features that indicate a dissolution of the oral narrative episode pattern are also visible in the text.

APA, Harvard, Vancouver, ISO, and other styles

39

Bouget, Hélène. "Trahison et résurgence de la matière arthurienne dans la trilogie de Michel Rio Merlin, Morgane, Arthur." Cahiers de recherches médiévales et humanistes, no. 19 (June 30, 2010): 191–206. http://dx.doi.org/10.4000/crm.12004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Doherty, John J. "'A land shining with goodness': Magic and Religion in Stephen R. Lawhead's Taliesin, Merlin, and Arthur." Arthuriana 9, no. 1 (1999): 57–66. http://dx.doi.org/10.1353/art.1999.0063.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Jain, R., A. Kolla, G. Midrijanis, and B. W. Reichardt. "On parallel composition of zero-knowledge proofs with black-box quantum." Quantum Information and Computation 9, no. 5&6 (May 2009): 513–32. http://dx.doi.org/10.26421/qic9.5-6-11.

Full text

Abstract:

Let $L$ be a language decided by a constant-round quantum Arthur-Merlin ($\QAM$) protocol with negligible soundness error and all but possibly the last message being classical. We prove that if this protocol is zero knowledge with a black-box, quantum simulator $\cS$, then $L \in \BQP$. Our result also applies to any language having a three-round quantum interactive proof ($\QIP$), with all but possibly the last message being classical, with negligible soundness error and a black-box quantum simulator. These results in particular make it unlikely that certain protocols can be composed in parallel in order to reduce soundness error, while maintaining zero knowledge with a black-box quantum simulator. They generalize analogous classical results of Goldreich and Krawczyk (1990). Our proof goes via a reduction to quantum black-box search. We show that the existence of a black-box quantum simulator for such protocols when $L \notin \BQP$ would imply an impossibly-good quantum search algorithm.

APA, Harvard, Vancouver, ISO, and other styles

42

Gharibian, Sevag, Jamie Sikora, and Sarvagya Upadhyay. "QMA variants with polynomially many provers." Quantum Information and Computation 13, no. 1&2 (January 2013): 135–57. http://dx.doi.org/10.26421/qic13.1-2-8.

Full text

Abstract:

We study three variants of multi-prover quantum Merlin-Arthur proof systems. We first show that the class of problems that can be efficiently verified using polynomially many quantum proofs, each of logarithmic-size, is exactly \class{MQA} (also known as QCMA), the class of problems which can be efficiently verified via a classical proof and a quantum verifier. We then study the class $\class{BellQMA}(\poly)$, characterized by a verifier who first applies unentangled, nonadaptive measurements to each of the polynomially many proofs, followed by an arbitrary but efficient quantum verification circuit on the resulting measurement outcomes. We show that if the number of outcomes per nonadaptive measurement is a polynomially-bounded function, then the expressive power of the proof system is exactly \class{QMA}. Finally, we study a class equivalent to \class{QMA}($m$), denoted $\class{SepQMA}(m)$, where the verifier's measurement operator corresponding to outcome {\it accept} is a fully separable operator across the $m$ quantum proofs. Using cone programming duality, we give an alternate proof of a result of Harrow and Montanaro [FOCS, pp. 633--642 (2010)] that shows a perfect parallel repetition theorem for $\class{SepQMA}(m)$ for any $m$.

APA, Harvard, Vancouver, ISO, and other styles

43

BERTAGNOLLI, PAUL. "Edward MacDowell's Original Program for the Sonata Eroica." Journal of the Society for American Music 9, no. 1 (February 2015): 61–107. http://dx.doi.org/10.1017/s1752196314000546.

Full text

Abstract:

AbstractManuscript sources for Edward MacDowell's Sonata Eroica (1895) divulge a radically different, notably more sinister program than the commentary that the composer imparted to Lawrence Gilman, his first biographer. Gilman's widely promulgated account, merely comprising four character sketches based on Tennyson's Arthurian epic, Idylls of the King, maintains that the score's movements respectively depict the coming of Arthur, Doré's engraving of a knight surrounded by elves, MacDowell's idea of Guinevere, and the passing of Arthur.Inscriptions in a continuity draft preserved at the Library of Congress, however, reveal that the first movement was initially conceived as an independent ballade (an intrinsically programmatic genre) and was originally inspired by Tennyson's portrayal of Vivien seducing Merlin. Another inscription discloses that MacDowell envisioned the third movement as Lancelot's adulterous serenade to Guinevere. Additional manuscript variants and close correlations between the score's vibrant musical topics and Tennyson's literary contexts demonstrate that the entire sonata, including the elfin scherzo and war-like finale, embodies a tale of seduction and its dire consequences.Although the Eroica's vivid, newly discovered program remains compatible with MacDowell's professed aesthetics, he suppressed the inscriptions. Speculative reasons for his doing so include formal considerations, critical opinions on programmaticism, and his attitudes toward sex.

APA, Harvard, Vancouver, ISO, and other styles

44

Tollit, Brendan, Alan Charles, William Poole, Andrew Cox, Glynn Hosking, Ben Lindley, Peter Smith, Andy Smethurst, and Jean Lavarenne. "WHOLE CORE COUPLING METHODOLOGIES WITHIN WIMS." EPJ Web of Conferences 247 (2021): 06006. http://dx.doi.org/10.1051/epjconf/202124706006.

Full text

Abstract:

The ANSWERS® WIMS reactor physics code is being developed for whole core multiphysics modelling. The established neutronics capability for lattice calculations has recently been extended to be suitable for whole core modelling of Small Modular Reactors (SMRs). A whole core transport, SP3 or diffusion flux solution is combined with fuel assembly resonance shielding and pin-by-pin differential depletion. An integrated thermal hydraulic solver permits differential temperature and density variations to feedback to the neutronics calculation. This paper presents new methodology developed in WIMS to couple the core neutronics to the integrated core thermal hydraulics solver. Two coupling routes are presented and compared using a challenging PWR SMR benchmark. The first route, called GEOM, dynamically calculates the resonance shielding and homogenisation with the whole core flux solution. The second coupling route, called CAMELOT, separates the resonance shielding and pincell homogenisation from the whole core solution via generating tabulated cross sections. Both routes can use the MERLIN homogenised pin-by-pin whole core flux solver and couple to the same integrated thermal hydraulic solver, called ARTHUR. Heterogeneous differences between the neutronics and thermal hydraulics are mapped via thermal identifiers for neutronics materials and thermal regions. The ability for the integrated thermal hydraulic solver to call an external code via a Fortran-C-Python (FCP) interface is also summarised. This flexible external coupling permits one way coupling to an external fuel performance code or two way coupling to an external thermal hydraulic code.

APA, Harvard, Vancouver, ISO, and other styles

45

Brennan, Joseph. "‘You Could Shame the Great Arthur Himself’: A Queer Reading of Lancelot from BBC’s Merlin with Respect to the Character in Malory, White, and Bradley." Arthuriana 25, no. 2 (2015): 20–43. http://dx.doi.org/10.1353/art.2015.0030.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Fabry-Tehranchi, Irène. "Arthur et ses barons rebelles. La fin remaniée et abrégée de la Suite Vulgate du Merlin dans le manuscrit du cycle du Graal (Paris, BnF, fr. 344, ca 1295)." Médiévales 67, no. 67 (December 31, 2014): 121–42. http://dx.doi.org/10.4000/medievales.7429.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Gingras, Francis. "La mauvaise langue et les lettres." Protée 32, no. 3 (September 1, 2005): 87–99. http://dx.doi.org/10.7202/011262ar.

Full text

Abstract:

Résumé La rumeur publique joue un rôle-clé dès les plus anciens textes français : elle motive les héros à la guerre et assure la renommée du saint auprès du bon peuple. Quand les auteurs vernaculaires délaissent les chansons de geste ou de saints (genres marqués par l’oralité) au profit d’une forme narrative bientôt appelée roman (genre défini d’abord par son rapport à l’écriture), la rumeur – qui fait et défait les héros – se voit concurrencée par l’écrit, auquel est attribuée une valeur de vérité supérieure. Le roman met ainsi en abyme sa propre quête de légitimité. Le statut ambigu de la narration médiévale, au carrefour de l’oralité et de l’écriture, se reflète dans la situation ambivalente de la rumeur, clairement associée au peuple et en position d’infériorité manifeste, mais demeurant néanmoins le véritable moteur de la narration. À ce titre, la rumeur, ou plus exactement la nouvelle « qui court et vole », devient un sujet autonome qui relance le récit, dans un apparent parallèle avec à la voix du narrateur. Au début du xiiie siècle, l’opposition entre roman et chanson se double d’une séparation entre vers et prose. Le roman en vers prend ses distances avec la rumeur en adoptant des accents parodiques, mais la prose est le lieu où la rumeur est mise en cause de la manière la plus systématique. Le roman en prose élabore ainsi un système complexe où la lettre et la voix se répondent. Par exemple, le grand cycle du Lancelot-Graal se clôt avec un roman, La Mort du roi Arthur, où la vérité vient de la lettre (missives révélatrices, inscriptions funéraires), alors même que la rumeur se révèle mortifère, depuis la rumeur de la fausse mort, qui a poussé Lancelot et Guenièvre au bord du suicide, jusqu’à celle qui condamne injustement la reine du meurtre de Gaheris de Karaheu. Le roman oppose ainsi à la voix de Merlin, le prophète à l’origine de ce royaume déchu, la permanence de la lettre, seule capable d’assurer la pérennité du royaume dans la mémoire et dans les lettres. La rumeur qui traverse les premières entreprises romanesques porte avec elle la question fondamentale du roman : celle de la vérité et du statut de la fiction, dans un monde où la langue vulgaire quitte la sphère de l’oralité et cherche à s’imposer comme langue d’écriture.

APA, Harvard, Vancouver, ISO, and other styles

48

Fresco, Karen. "Lancelot-Grail: The Old French Arthurian Vulgate and Post-Vulgate in Translation, Vol. III: Lancelot, Part IV ed. by Norris J. Lacy and ed. by Roberta L. Krueger, and: Lancelot, Part V trans. by William W. Kibler, and: Lancelot, Part VI trans. by Carlton W. Carroll, and: Vol. IV: The Quest for the Holy Grail trans. by E. Jane Burns, and: The Death of Arthur trans. by Norris J. Lacy, and: The Post-Vulgate, Part I, The Merlin Continuation introd. and trans. by Martha Asher." Arthuriana 8, no. 1 (1998): 86a—90. http://dx.doi.org/10.1353/art.1998.0062.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Miltersen, Peter Bro, and Vinodchandran N. Variyam. "Derandomizing Arthur-Merlin Games using Hitting Sets." BRICS Report Series 6, no. 47 (December 17, 1999). http://dx.doi.org/10.7146/brics.v6i47.20117.

Full text

Abstract:

We prove that AM (and hence Graph Nonisomorphism) is in NP if for some epsilon > 0, some language in NE intersection coNE requires nondeterministic circuits of size 2^(epsilon n). This improves recent results of Arvind and K¨obler and of Klivans and Van Melkebeek who proved the same conclusion, but under stronger hardness assumptions, namely, either the existence of a language in NE intersection coNE which cannot be approximated by nondeterministic circuits of size less than 2^(epsilon n) or the existence of a language in NE intersection coNE which requires oracle circuits of size 2^(epsilon n) with oracle gates for SAT (satisfiability). The previous results on derandomizing AM were based on pseudorandom generators. In contrast, our approach is based on a strengthening of Andreev, Clementi and Rolim's hitting set approach to derandomization. As a spin-off, we show that this approach is strong enough to give an easy (if the existence of explicit dispersers can be assumed known) proof of the following implication: For some epsilon > 0, if there is a language in E which requires nondeterministic circuits of size 2^(epsilon n), then P=BPP. This differs from Impagliazzo and Wigderson's theorem "only" by replacing deterministic circuits with nondeterministic ones.

APA, Harvard, Vancouver, ISO, and other styles

50

Bookatz, Adam D., Stephen P. Jordan, Yi-Kai Liu, and Pawel Wocjan. "Quantum nonexpander problem is quantum-Merlin-Arthur-complete." Physical Review A 87, no. 4 (April 15, 2013). http://dx.doi.org/10.1103/physreva.87.042317.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Arthur-Merlin'

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