Skip to Main Content
Frequently Asked Questions
Submit an ETD
Global Search Box
Need Help?
Keyword Search
Participating Institutions
Advanced Search
School Logo
Files
File List
KoKer-I1979 sm.pdf (1.89 MB)
ETD Abstract Container
Abstract Header
Computational Complexity of Real Functions and Polynomial Time Approximations
Author Info
Ko, Ker-I
Permalink:
http://rave.ohiolink.edu/etdc/view?acc_num=osu1383821990
Abstract Details
Year and Degree
1979, Doctor of Philosophy, Ohio State University, Computer Science and Engineering.
Abstract
N/A
Committee
Daniel J. Moore (Advisor)
Pages
170 p.
Subject Headings
Computer Science
Recommended Citations
Refworks
EndNote
RIS
Mendeley
Citations
Ko, K.-I. (1979).
Computational Complexity of Real Functions and Polynomial Time Approximations
[Doctoral dissertation, Ohio State University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=osu1383821990
APA Style (7th edition)
Ko, Ker-I.
Computational Complexity of Real Functions and Polynomial Time Approximations .
1979. Ohio State University, Doctoral dissertation.
OhioLINK Electronic Theses and Dissertations Center
, http://rave.ohiolink.edu/etdc/view?acc_num=osu1383821990.
MLA Style (8th edition)
Ko, Ker-I. "Computational Complexity of Real Functions and Polynomial Time Approximations ." Doctoral dissertation, Ohio State University, 1979. http://rave.ohiolink.edu/etdc/view?acc_num=osu1383821990
Chicago Manual of Style (17th edition)
Abstract Footer
Document number:
osu1383821990
Download Count:
168
Copyright Info
© 1979, all rights reserved.
This open access ETD is published by The Ohio State University and OhioLINK.