A combinatorial approach to complexity
- Cite this article as:
- Pudlák, P. & Rödl, V. Combinatorica (1992) 12: 221. doi:10.1007/BF01204724
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