Date: Wednesday, 15-Jan-97 00:23:40 GMT Server: NCSA/1.3 MIME-version: 1.0 Content-type: text/html Last-modified: Friday, 06-Dec-96 19:56:46 GMT Content-length: 1695
I have conducted research in the area of computational complexity, a subfield of theoretical computer science. Computational complexity is the study of the quantitative laws of computation. Its final goals are (1) clarifying what makes problems hard, (2) classifying problems according to their computational hardness, and (3) deepening on trade-offs between comptuational resources. The classification of problems is based on the model of computtation (Turing machines, Boolean circuits, RAM, etc.), the mode of computation (deterministic, nondeterministic, probabilistic, and so on), and bounds on the recourses (time, space, depth, and so on).
My current research interests are: design and implementation of parallel data-mining algorithms, biomolecular computing, computation based on counting, and sets with low information content.
Back to Mitsunori Ogihara's Home Page
Back to Computer Science Faculty Page