Hints and tips:
  • You may need to look up some unfamiliar terms in the title or description to get more of a sense of what is involved.
  • If the project has "No" in the "Current Availability:" field, it is already taken or not being offered this academic year but may be available again in future years.
  • The supervisor name links to a contact details webpage so, if you are interested, you can arrange to discuss this project or even propose a related topic of your own.
Level: TBC
Title: Algorithmics
Supervisor:

Prof. Charles Leedham-Green
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