Functions on groups and computational complexity

Details Functions on groups and computational complexity Functions on groups and computational complexity

2002-02-13

arxiv.org/abs/math/0202124v1

Mathematics

Group Theory

Scientific paper

We give some connections between various functions defined on finitely presented groups (isoperimetric, isodiametric, Todd-Coxeter radius, filling length functions, etc.), and we study the relation between those functions and the computational complexity of the word problem (deterministic time, nondeterministic time, symmetric space). We show that the isoperimetric function can always be linearly decreased (unless it is the identity map). We present a new proof of the Double Exponential Inequality, based on context-free languages.

Affiliated with

Also associated with

No associations

Rating

Functions on groups and computational complexity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Functions on groups and computational complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Functions on groups and computational complexity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-308373