This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
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–64
L. Budach, A lower bound for the number of nodes in a decision tree. Elektron. Inf. verarb. Kybern. EIK 21 (1985), 221–228
L. Budach, B. Graw, Nonuniform complexity classes, decision graphs and homological properties of posets. L.N.C.S. 208 (1985). 7–13
L. Budach, Topological invariants of classification problems, Printemps d'informatique théorique, Université Paris 6, in print
J. Cheeger, W. Müller, R. Schrader, On the curvature of piecewise linear spaces, Commun. Math. Phys. 92 (1984), 405–454
W. Marek, Z. Pawlak, Information storage and retrieval systems. Mathematical foundations. Theoretical Computer Science 1 (1976), 331–354
C. Picard, Theorie der Fragebögen. Berlin, Akademie Verlag, 1973
E.H. Spanier, Algebraic topology, McGraw-Hill, 1966
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Budach, L. (1987). Arsenals and lower bounds. In: Budach, L., Bukharajev, R.G., Lupanov, O.B. (eds) Fundamentals of Computation Theory. FCT 1987. Lecture Notes in Computer Science, vol 278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18740-5_17
Download citation
DOI: https://doi.org/10.1007/3-540-18740-5_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18740-0
Online ISBN: 978-3-540-48138-6
eBook Packages: Springer Book Archive