Fundamental search problems in group theory.
Item
-
Title
-
Fundamental search problems in group theory.
-
Identifier
-
AAI3187428
-
identifier
-
3187428
-
Creator
-
Ushakov, Alexander.
-
Contributor
-
Advisers: Alexei G. Miasnikov | Jozef Dodziuk
-
Date
-
2005
-
Language
-
English
-
Publisher
-
City University of New York.
-
Subject
-
Mathematics
-
Abstract
-
We consider search variations of the fundamental problems of the group theory: the Word search problem and the Conjugacy search problem. For each of these problems we propose effective algorithms for solving the problem and prove the efficiency of the algorithm. More precisely, we show that each algorithm has polynomial-time generic-case complexity.
-
Type
-
dissertation
-
Source
-
PQT Legacy CUNY.xlsx
-
degree
-
Ph.D.