, Volume 12, Issue 2, pp 221-226

A combinatorial approach to complexity

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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.