We present a problem of construction of certain intersection graphs. If these graphs were explicitly constructed, we would have an explicit construction of Boolean functions of large complexity.
AMS Subject Classification code (1991)68 R 10
Unable to display preview. Download preview PDF.
- R. Paturi, andJ. Simon: Probabilistic communication complexity,25-th FOCS (1984), 118–126.Google Scholar