📄 http:^^www.cs.rochester.edu^users^faculty^ogihara^research^main.html
字号:
Date: Wednesday, 15-Jan-97 00:23:40 GMTServer: NCSA/1.3MIME-version: 1.0Content-type: text/htmlLast-modified: Friday, 06-Dec-96 19:56:46 GMTContent-length: 1695<HTML><HEAD><TITLE>Mitsunori Ogihara's Research Home Page</TITLE></HEAD><BODY><!WA0><IMG ALIGN=TOP SRC="http://www.cs.rochester.edu/images/urcslogo.gif"><P>I have conducted research in thearea of computational complexity, a subfield of theoretical computerscience. Computational complexity is the study of thequantitative laws of computation. Its final goals are(1) clarifying what makes problems hard, (2) classifying problemsaccording to their computational hardness, and (3) deepening ontrade-offs between comptuational resources.The classification of problems is based on the model ofcomputtation (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).<P>My current research interests are:<i>design and implementation of parallel data-mining algorithms,biomolecular computing, computation based on counting, andsets with low information content.</i><P><B> <!WA1><A HREF="http://www.cs.rochester.edu/users/faculty/ogihara/research/pubs.html"> Recent Publications</A></B><P><P><!WA2><A HREF="http://www.cs.rochester.edu/users/faculty/ogihara/home.html"> <!WA3><IMG ALIGN=TOP SRC="http://www.cs.rochester.edu/images/up.gif">Back to Mitsunori Ogihara's Home Page</A><P><!WA4><A HREF="http://www.cs.rochester.edu/users/faculty.html"> <!WA5><IMG ALIGN=TOP SRC="http://www.cs.rochester.edu/images/back.gif">Back to Computer Science Faculty Page </A><P><P><HR><P><center><B> <!WA6><A HREF="http://www.cs.rochester.edu/users/faculty/ogihara/research/name.html"> Why I changed my name from Ogiwara to Ogihara. </A></B></center><P><HR></BODY></HTML>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -