Proceedings 17th IEEE Annual Conference on Computational Complexity
Like what you’re reading?
Already a member?
Related Articles
- Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds
2010 IEEE 25th Annual Conference on Computational Complexity - Derandomizing Arthur-Merlin Games Using Hitting Sets
40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) - Nondeterministic Circuit Lower Bounds from Mildly De-randomizing Arthur-Merlin Games
2012 IEEE 27th Conference on Computational Complexity - Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games
18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings. - Arthur-Merlin Games in Boolean Decision Trees
Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247) - An Efficient Test for Product States with Applications to Quantum Merlin-Arthur Games
2010 IEEE 51st Annual Symposium on Foundations of Computer Science - On Arthur Merlin Games in Communication Complexity
2011 IEEE 26th Annual Conference on Computational Complexity - Quantum Arthur-Merlin Games
Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004. - Quantum t-designs: t-wise Independence in the Quantum World
Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07) - Seeing into the Quantum World
Computing in Science & Engineering