|Harry B. Hunt III
Ph.D., Cornell University
Computer Science Department
University at Albany
Albany, NY 12222
(518) 442-5638 (FAX)
|Personal Statement of Research|
Intuitively, the complexity of a problem is the amount of some resource,
e.g. time, space, size of circuit, number of processors, etc., required to
solve it. A problem is "hard" if its solution requires a large amount of
the resource. It is "easy" if its solution requires a small amount of the
resource. My research centers upon finding answers to the questions --
1. What makes particular problems "hard"?
2. What makes other problems "easy"?
I am interested in finding answers, for questions 1 and 2 for problems for the various structures studied in computer science and applied mathematics. Structures under investigation include graphs and hypergraphs, abstract algebraic structures (e.g., lattices, semi-lattices, rings, semi-rings), discrete and finite dynamical systems, networks of communicating processes, and combinatorial games.
Research is also underway in the areas of combinatorial and sequential logic, database systems, program development and code optimization in high- performance scientific programming, simulation science, and combinatorial optimization and approximation. Much of this work is joint with coworkers here and/or at Los Alamos National Laboratory, Los Alamo, New mexico.