Logspace Computations in Graph Groups and Coxeter Groups

Volker Diekert; Jonathan Kausch; Markus Lohrey

doi:10.1007/978-3-642-29344-3_21

ScienceGate Book Chapters

BOOK-CHAPTER

Logspace Computations in Graph Groups and Coxeter Groups

Volker Diekert Jonathan Kausch Markus Lohrey

Year: 2012 Lecture notes in computer science Pages: 243-254 Publisher: Springer Science+Business Media

DOI: 10.1007/978-3-642-29344-3_21

Get Full-Text PDF Get Analytical Report

Keywords:

Coxeter group Artin group Longest element of a Coxeter group Mathematics Coxeter element Combinatorics Point group Coxeter complex Algebraic number Discrete mathematics

Metrics

Cited By

1.57

FWCI (Field Weighted Citation Impact)

Refs

0.78

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

semigroups and automata theory

Physical Sciences → Computer Science → Computational Theory and Mathematics

Geometric and Algebraic Topology

Physical Sciences → Mathematics → Geometry and Topology

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Logspace Computations in Graph Groups and Coxeter Groups

Metrics

Citation History

Topics

Related Documents

Logspace and compressed-word computations in nilpotent groups

Coxeter groups in Coxeter groups

Logspace computations in graph products

Logspace computations in graph products

Automorphisms of Graph-Universal Coxeter Groups