Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds
- B. Aydinliog̃lu
- Dan Gutfreund
- et al.
- 2011
- Computational Complexity
This is our catalog of publications authored by IBM researchers, in collaboration with the global research community. It’s an ever-growing body of work that shows why IBM is one of the most important contributors to modern computing.