Brian J. d'Auriol, Ph.D.



Pramod Kumar Chikkappaiah, Complexity in the Geometric Representation of Programs (GRP) Model, Department of Computer Science, The University of Texas at El Paso, May 2003. Advisor: Brian J. d'Auriol
There is no existing method at present to find the complexity of algorithms in the GRP model. This thesis proposes a model called the Volume Complexity Model to find the complexity of programs represented in GRP. The volume of a geometric object can be thought of as representing characteristics associated with complexity. Thus, it is meaningful to calculate the volume of a geometric object. Hence, this thesis deals with the issue of how best volumes can be correlated to the problem of finding the complexity of programs in GRP. The main objective of this work is to enhance the existing GRP model in a new and logical direction so as to make the model more application oriented. 