Search for Author All Reviews
	Ko, Ker     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 5 of 5 reviews       Computational complexity of two-dimensional regions Chou A., Ko K. (ed) SIAM Journal on Computing 24(5): 923-947, 1995.  Type: Article The notion of polynomial-time computability is crucial to discrete complexity theory. But complex analysis has been and is fundamentally continuous. Therefore, this paper is a gamble based on the authors’ expectation that pol...... Oct 1 1996     A polynomial-time computable curve whose interior has a nonrecursive measure Ko K. (ed) Theoretical Computer Science 145(1-2): 241-270, 1995.  Type: Article Ko addresses two problems in this paper. First, given a  simple  closed curve in two-dimensional Euclidean space, obtain the area of its interior. Second, given a  simple  curve in two-dimensional Eu...... Sep 1 1996     Complexity theory of real functions Ko K. (ed), Birkhäuser Boston Inc., Cambridge, MA, 1991.  Type: Book (9780817635862) Polynomial complexity theory, introduced in the pioneering works of Cook, Karp, and Levin on NP-completeness in 1970 and 1971, has inspired a new style of mathematics, namely polynomial mathematics. This style supplements the other est...... Jan 1 1993     A note on the two-variable pattern-finding problem Ko K. (ed), Hua C. Journal of Computer and System Sciences 34(1): 75-86, 1987.  Type: Article This paper deals with an inductive inference problem: Given a sequence of strings over an alphabet &Sgr;, find a single (short) formula p of symbols in &Sgr; and additional variables x, y, z, . . . that generates ...... Apr 1 1989     On the computational complexity of ordinary differential equations Ko K. (ed) Information and Control 58(1-3): 157-194, 1984.  Type: Article The basic thrust of the author’s research is an application of the classical Turing-machine based theory of computation to the classical problems of numerical analysis. This paper deals with the polynomial time computability ...... Jun 1 1985
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy