A combinatorial approach to complexity | Combinatorica
Skip to main content
Springer Nature Link
Log in

A combinatorial approach to complexity

  • Published:
Combinatorica Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. L. Lovász: On the Shannon capacity of graphs,IEEE Transactions of Information theory,IT-25 (1979), 1–7.

    Article  MathSciNet  Google Scholar 

  2. T. D. Parsons, andT. Pisanski: Vector representations of graphs, to appear inDiscrete Math. 78 (1989), 143–154.

    Article  MathSciNet  Google Scholar 

  3. R. Paturi, andJ. Simon: Probabilistic communication complexity,25-th FOCS (1984), 118–126.

  4. P. Pudlák, V. Rödl, andP. Savický: Graph complexity,Acta Informatica 25 (1988), 515–535.

    MathSciNet  MATH  Google Scholar 

  5. A. A. Razborov: Applications of matrix methods for the theory of lower bounds in computational complexity,Combinatorica 10 (1990), 81–93.

    Article  MathSciNet  Google Scholar 

  6. J. Reiterman, V. Rödl, andE. Šiňajová: Geometrical embeddings of graphs,Discrete Math. 74 (1989), 291–319.

    Article  MathSciNet  Google Scholar 

  7. J. Reiterman, V. Rödl, andE. Šiňajová: Embeddings of graphs in euclidean spaces,Discrete Comput Geom. 4 (1989), 349–364.

    Article  MathSciNet  Google Scholar 

  8. H. E. Warren: Lower bounds for approximations by nonlinear manifolds,Transactions AMS 133 (1968), 167–178.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Institute, ČSAV, Žitná ul. 25, 11567, Praha 1, Czech Republic

    P. Pudlák

  2. Department of Mathematics, Emory University, 30322, Atlanta, GA, USA

    V. Rödl

Authors
  1. P. Pudlák
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. Rödl
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pudlák, P., Rödl, V. A combinatorial approach to complexity. Combinatorica 12, 221–226 (1992). https://doi.org/10.1007/BF01204724

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01204724

AMS Subject Classification code (1991)

Search

Navigation