Borel sets and circuit complexity
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
The Infinite Versions of LOGSPACE != P Are Consistent with the Axioms of Set Theory
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
In 1986, Babai, Frankl and Simon (BFS86) defined the polynomial hierarchy in communication complexity and asked whether Σee2 = Φee2. In order to tackle this problem, researchers have looked at an infinite version. We recently became aware of a paper from 1979 where Miller [Mil79] shows that this infinite version is independent of the axioms of set theory. In this note we will describe Miller's result and give a simplified proof of one direction by showing that the continuum hypothesis implies that Σr2 = Φr2p (R × R).