Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds
- Dan Gutfreund
- Akinori Kawachi
- 2010
- CCC 2010
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.