Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
109
click to vote
IJAC
2010
128
views
more
IJAC 2010
»
Compressed Words and Automorphisms in Fully Residually Free Groups
15 years 1 months ago
Download
www.math.mcgill.ca
We show that the compressed word problem in a finitely generated fully residually free group (F-group) is decidable in polynomial time, and use this result to show that the word ...
Jeremy MacDonald
claim paper
Read More »