Advertisement

Arsenals and lower bounds

  • Lothar Budach
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 278)

Keywords

Boolean Function Classification Problem Simplicial Complex Minimal Element Betti Number 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    L. Budach, Klassifizierungsprobleme und das Verhältnis von deterministischer zu nichtdeterministischer Raumkomplexitat. Seminarbericht der Sektion Mathematik der Humboldt-Universität zu Berlin 68 (1985), 1–64Google Scholar
  2. [2]
    L. Budach, A lower bound for the number of nodes in a decision tree. Elektron. Inf. verarb. Kybern. EIK 21 (1985), 221–228Google Scholar
  3. [3]
    L. Budach, B. Graw, Nonuniform complexity classes, decision graphs and homological properties of posets. L.N.C.S. 208 (1985). 7–13Google Scholar
  4. [4]
    L. Budach, Topological invariants of classification problems, Printemps d'informatique théorique, Université Paris 6, in printGoogle Scholar
  5. [5]
    J. Cheeger, W. Müller, R. Schrader, On the curvature of piecewise linear spaces, Commun. Math. Phys. 92 (1984), 405–454Google Scholar
  6. [6]
    W. Marek, Z. Pawlak, Information storage and retrieval systems. Mathematical foundations. Theoretical Computer Science 1 (1976), 331–354Google Scholar
  7. [7]
    C. Picard, Theorie der Fragebögen. Berlin, Akademie Verlag, 1973Google Scholar
  8. [8]
    E.H. Spanier, Algebraic topology, McGraw-Hill, 1966Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Lothar Budach
    • 1
  1. 1.Akademie der Wissenschaften der DDR Forschungsbereich Mathematik und InformatikBerlin

Personalised recommendations