Combinatorica

, Volume 12, Issue 2, pp 221–226

A combinatorial approach to complexity

  • P. Pudlák
  • V. Rödl
Article

DOI: 10.1007/BF01204724

Cite this article as:
Pudlák, P. & Rödl, V. Combinatorica (1992) 12: 221. doi:10.1007/BF01204724

Abstract

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 

Copyright information

© Akadémiai Kiadó 1992

Authors and Affiliations

  • P. Pudlák
    • 1
  • V. Rödl
    • 2
  1. 1.Mathematical InstituteČSAVPraha 1Czech and Slovak Federal Republic
  2. 2.Department of MathematicsEmory UniversityAtlantaUSA

Personalised recommendations