Published in: Open Access 01-06-2005 | Original Paper Quantum Arthur–Merlin games Authors: Chris Marriott, John Watrous Published in: computational complexity | Issue 2/2005 Read the PDF-Version of this Article. loading … previous article The complexity of the covering radius problem next article Parameterized complexity of constraint satisfaction problems download DOWNLOAD print PRINT