Isoperimetric and isodiametric functions of groups

@article{Sapir1998IsoperimetricAI,
  title={Isoperimetric and isodiametric functions of groups},
  author={M. Sapir and J. Birget and E. Rips},
  journal={Annals of Mathematics},
  year={1998},
  volume={156},
  pages={345-466}
}
This is the first of two papers devoted to connections between asymptotic functions of groups and computational complexity. In particular, we show how to construct a finitely presented group with NP-complete word problem. One of the main results of this paper states that if a real number cx > 4 is computable in time 0 then na is equivalent ( "big O" ) to the Dehn function of a finitely presented group. The smallest isodiametric function of this group is n3°8/4. On the other hand, if na is… Expand
A ug 2 01 8 The isoperimetric spectrum of finitely presented groups
The Groups of Richard Thompson and Complexity
  • J. Birget
  • Mathematics, Computer Science
  • Int. J. Algebra Comput.
  • 2004
SPACE FUNCTIONS OF GROUPS
SPACE FUNCTIONS OF GROUPS
The Post correspondence problem in groups
A Note on Square Rooting of Time Functions of Turing Machines
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 41 REFERENCES
Isoperimetric inequalities and the homology of groups
Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem
  • J. Birget
  • Mathematics, Computer Science
  • Int. J. Algebra Comput.
  • 1998
The Double exponential Theorem for isodiametric and isoperimetric Functions
  • S. Gersten
  • Mathematics, Computer Science
  • Int. J. Algebra Comput.
  • 1991
Pseudo-Natural Algorithms for the Word Problem for Finitely Presented Monoids and Groups
Handbook of Theoretical Computer Science
...
1
2
3
4
5
...