An algorithm for the word problem in extensions and the dependence of its complexity on the group representation
J. Avenhaus, K. Madlener (1981)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
J. Avenhaus, K. Madlener (1981)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Giné, Evarist, Götze, Friedrich (2004)
Electronic Communications in Probability [electronic only]
Similarity:
André Arnold (1997)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Shao, Qi-Man, Su, Chun, Wei, Gang (2004)
Electronic Journal of Probability [electronic only]
Similarity:
Killian, Charles E., Ruskey, Frank, Savage, Carla D., Weston, Mark (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Hung, Ying-Chao, Chen, Robert W., Zame, Alan, Chen, May-Ru (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Li, Deli, Rosalsky, Andrew (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Bergeron, F., Lamontagne, F. (2004)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Foata, Dominique, Han, Guo-Niu (2007)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Andreas Weber (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: