On the advice complexity of tournaments

Abstract

Advice complexity, introduced by Karp and Lipton, asks how many bits of "help" suffice to accept a given language. This is a notion that contains aspects both of informational and computational complexity, and captures non-uniform complexity. We are concerned with the connection between this notion and P-selective sets. The main question we study in our paper is how complex should the advice be as a function of the power of the interpreter, from the standpoint of average-case complexity. In the deterministic case, Ko proved that quadratic advice suffices, and Hemaspaandra and Torenvliet showed that linear advice is required. A long standing open problem is the question how to close this gap. We prove that in the probabilistic case linear size advice is enough, as long as this advice depends on the randomness. This is the first sub-quadratic result for the class P-sel for bounded-error probabilistic machines. As a consequence, several Karp-Lipton type theorems are obtained. Our methods are based on several fundamental concepts of theoretical computer science, as hardness amplification and Von Neumann's Minimax theorem, and demonstrate surprising connections between them and the seemingly unrelated notion of selectivity. © 2012 Springer-Verlag.