• Publications
  • Influence
Complexity Theory of Real Functions
  • K. Ko
  • Mathematics, Computer Science
  • Progress in Theoretical Computer Science
  • 1991
TLDR
" polynomial complexity theory extends the notions and tools of the theory of computability to provide a solid theoretical foundation for the study of computational complexity of practical problems. Expand
Theory of Computational Complexity
UNIFORM COMPLEXITY. Models of Computation and Complexity Classes. NP-Completeness. The Polynomial-Time Hierarchy and Polynomial Space. Structure of NP. NONUNIFORM COMPLEXITY. Decision Trees. CircuitExpand
On Self-Reducibility and Weak P-Selectivity
  • K. Ko
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 1 April 1983
TLDR
It is proved that self-reducible sets are not polynomial-time Turing reducible to these sets, and weakly p -selective sets are introduced as a generalization of p - selective sets based on this characterization. Expand
On the Complexity of Min-Max Optimization Problems and their Approximation
The computational complexity of optimization problems of the min-max form is naturally characterized by ∏ 2 P , the second level of the polynomial-time hierarchy. We present a number of optimizationExpand
Computational Complexity of Real Functions
TLDR
The oracle Turing machine is introduced as the formal model for computing real functions and the class of polynomial time computable real functions is defined, and several characterizations of this class will be given. Expand
Design and Analysis of Approximation Algorithms
TLDR
This book organizes approximation algorithms into different chapters, based on the design techniques for the algorithms, so that the reader and teacher can study approximation algorithms of the same nature together. Expand
On Helping by Robust Oracle Machines
  • K. Ko
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1 May 1987
TLDR
The concept of helping by robust oracle Turing machines is extended to the notion of ‘one-sided helping’ and its relations to the structural properties of NP sets are investigated. Expand
On Some Natural Complete Operators
  • K. Ko
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1985
TLDR
This work investigates several natural operators which share similar properties and uses the concept of completeness to give a precise classification of the complexity of these operators. Expand
On the Notion of Infinite Pseudorandom Sequences
  • K. Ko
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 15 December 1986
TLDR
It is shown that the first two definitions of infinite pseudorandom sequences are equivalent with respect to polynomial space complexity, while both are strictly stronger than the third definition, which is derived from Von Mises's notion of collectives. Expand
...
1
2
3
4
5
...