Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds

Computational Complexity - Switzerland
doi 10.1007/s00037-011-0010-8
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Lower Bounds for Swapping Arthur and Merlin

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2007English

On Lower Bounds of Exponential Frames

Journal of Fourier Analysis and Applications
MathematicsApplied MathematicsAnalysis
1999English

Sampling-Based Lower Bounds for Counting Queries

Intelligenza Artificiale
Artificial Intelligence
2011English

Exponential Lower Bounds for the Pigeonhole Principle

1992English

Exponential Lower Bounds and Integrality Gaps for Tree-Like Lovász-Schrijver Procedures

2009English

Quantum Nonexpander Problem Is Quantum-Merlin-Arthur-Complete

Physical Review A
2013English

Lower Bounds

2016English

From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Statistics of the MLE and Approximate Upper and Lower Bounds—Part I: Application to TOA Estimation

IEEE Transactions on Signal Processing
Electronic EngineeringSignal ProcessingElectrical
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy