This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
M. Aigner, Combinatorial Theory Springer-Verlag, Berlin, 1979.
D. A. Barrington, Bounded-Width Polynomial-Size Branching Programs Recognize Exactly those Languages in NC1. Proceedings 18-th ACM Symposium on Theory of Computing (1986), 1–5.
D. A. Barrington, D. Thérien, Finite Monoids and the Fine Structure of NC1. Proceedings 19-th ACM Symposium on Theory of Computing (1987), 101–109.
D. A. Barrington, D. Thérien, Nonuniform Automata over Groups. Proceedings 14-th International Colloquium on Automata, Languages and Programming (1987), 264–279.
G. Birkhoff, Lattice Theory, AMS Colloquium Publications 25, American Mathematical Society, Providence, Rhode Island, 1967.
A. Björner, Some Combinatorial and Algebraic Properties of Coxeter Complexes and Tits Buildings. Advances in Mathematics 52(1984), 173–212.
A. Björner, Orderings of Coxeter Groups. Contemporary Mathematics 34(1984), 175–195.
A. Björner, On Matroids, Groups and Exchange Languages. Colloquia Mathematica Societatis Janos Bolyai, 40, Matroid Theory (ed. A. Recski, L. Lovasz), North Holland, Amsterdam, 1985.
N. Bourbaki, Groupes et algébres de Lie, Chapitre 4,5,6 Hermann, Paris 1968.
L. Budach, Klassifizierungsprobleme und das Verhältnis von deterministischer und nichtdeterministischer Raumkomplexität, Berlin, Humboldt-Universität, Sektion Mathematik, Seminarbericht Nr.68, 1985.
L. Budach, A Lower Bound for the Number of Nodes in Decision Trees, EIK 21(1985), 221–228.
L. Budach, Arsenals and Lower Bounds, Lecture Notes in Computer Science 278(1987), 55–64.
L. Budach, B. Graw, Nonuniform Complexity Classes, Decision Graphs and Homological Properties of Posets, Lecture Notes in Computer Science 208(1985),7–13.
L. Budach, B. Graw, C. Meinel, S. Waack, Algebraic and Topological Properties of Finite Partially Ordered Sets, BSB Teubner Leipzig,1988.
H. S. M. Coxeter, Discrete Groups Generated by Reflections. Annals of Mathematics 35(1934), 588–621.
H. S. M. Coxeter, The Complete Enumeration of Finite Groups of the Form R 2 i =(R i R j )k ij . Journal of the London Mathematical Society 10(1935), 21–25.
V. V. Deodhar, Some Characterizations of Bruhat Ordering on a Coxeter Group and Determination of the Relative Möbius Function, Inventiones Mathematicae 39(1977), 187–198.
T. Tom Dieck, Transformation Groups and Representation Theory. Lecture Notes in Mathematics, vol. 766, Springer-Verlag, Berlin 1979.
I.M. Gelfand, R.M. Goresky, R.D. MacPherson, V.V. Serganova, Combinatorial Geometries, Convex Polyhedra, and Schubert Cells. Advances in Mathematics 63(1987), 301–316.
J. Kahn, M. Saks, D. Sturtevant, A Topological Approach to Evasiveness, Combinatorica 4(1984), 297–306.
D. Knuth, The Art of Computer Programming, vol. 3 Addison-Wesley, Reading 1974.
B. Korte, L. Lovasz, Posets, Matroids, and Greedoids. Colloquia Mathematica Societatis Janos Bolyai, 40, Matroid Theory (ed. A. Recski, L. Lovasz), North Holland, Amsterdam, 1985.
K. Kriegel, S. Waack, Lower Bounds on the Complexity of Real-Time Branching Programs. Informatique théorique et Applications 22(1988), 447–459.
A. A. Razborow, Lower Bounds for the Monotone Complexity of Logical Permanent. Matematičeskije Zametki 37(1985), 887–900.
A. A. Razborow, Lower Bounds on the Size of Bounded-Depth Networks over the Basis {{Λ,⊕}}. Preprint (in Russian), Moscow State University, 1986.
A. Rosenberg, On the Time Required to Recognize Properties of Graphs: A Problem, SIGACT News 5(4) (1973), 15–16.
R. Smolensky, Algebraic Methods in the Theory of Lower Bounds for Boolean Circuit Complexity. Proceedings 19-th ACM Symposium on Theory of Computing (1987), 77–82.
J. Thévenaz, Permutation Representations Arising from Simplicial Complexes. Journal of Combinatorial Theory, Series A, 46(1987),121–155.
J. Tits, Buildings of Spherical Type and Finite BN-Pairs, Lecture Notes in Mathematics 386, Springer, Berlin 1974.
I. Wegener, Optimal Decision Trees and One-Time-Only Branching Programs for Symmetric Boolean Functions, Information and Computation 62 (1984), 129–143.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Graw, B. (1989). Decision problems and Coxeter groups. In: Csirik, J., Demetrovics, J., Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1989. Lecture Notes in Computer Science, vol 380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51498-8_20
Download citation
DOI: https://doi.org/10.1007/3-540-51498-8_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51498-5
Online ISBN: 978-3-540-48180-5
eBook Packages: Springer Book Archive