Date of Award

8-6-2007

Degree Type

Thesis

Degree Name

Master of Science (MS)

Department

Mathematics and Statistics

First Advisor

Florian Enescu - Chair

Second Advisor

Yongwei Yao

Third Advisor

Mihaly Bakonyi

Abstract

In this thesis we discuss how to find equivalent representations of polynomial functions over the ring of integers modulo a power of a prime. Specifically, we look for lower degree representations and representations with fewer variables for which important applications in electrical and computer engineering exist. We present several algorithms for finding these compact formulations.

Included in

Mathematics Commons

Share

COinS