Level: TBC
Title: Algorithmics
Supervisor:
Research Area: Algebra
Description:

Determine the complexity of various algorithms in algebra. For example, we have an algorithm for multiplying elements of finite soluble groups, but have no analysis of how efficient the method is. On a more practical level, write a program (probably in C) to multiply elements of a finite soluble group.

Further Reading:

Literature suggestions will be supplied.

Key Modules:

To be confirmed with the supervisor.

Other Information:
Current Availability: Yes