The following pages link to Ker-I. Ko (Q1295380):
Displayed 50 items.
- (Q281788) (redirect page) (← links)
- (Q1276317) (redirect page) (← links)
- An approximation algorithm for maximum weight budgeted connected set cover (Q281790) (← links)
- On parallel complexity of analytic functions (Q388112) (← links)
- The computational complexity of distance functions of two-dimensional domains (Q557838) (← links)
- Design and analysis of approximation algorithms (Q648055) (← links)
- A polynomial-time computable curve whose interior has a nonrecursive measure (Q673102) (← links)
- Three \(\sum^ P_ 2\)-complete problems in computational learning theory (Q685716) (← links)
- A greedy approximation for minimum connected dominating sets (Q706637) (← links)
- Reducibilities on real numbers (Q795039) (← links)
- On adaptive versus nonadaptive bounded query machines (Q808242) (← links)
- On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain (Q864430) (← links)
- On the complexity of computing the logarithm and square root functions on a complex domain (Q870336) (← links)
- Jordan curves with polynomial inverse moduli of continuity (Q995570) (← links)
- On self-reducibility and weak P-selectivity (Q1054475) (← links)
- On some natural complete operators (Q1064780) (← links)
- Continuous optimization problems and a polynomial hierarchy of real functions (Q1086557) (← links)
- Approximation to measurable functions and its relation to probabilistic computation (Q1088659) (← links)
- On the notion of infinite pseudorandom sequences (Q1091817) (← links)
- On the continued fraction representation of computable real numbers (Q1096627) (← links)
- Corrigenda to: ``On the continued fraction representation of computable real numbers'' (Q1096628) (← links)
- On one-way functions and polynomial-time isomorphisms (Q1097694) (← links)
- On helping by robust oracle machines (Q1097695) (← links)
- Identification of pattern languages from examples and queries (Q1097709) (← links)
- A note on the two-variable pattern-finding problem (Q1097711) (← links)
- Computing power series in polynomial time (Q1102956) (← links)
- On the complexity of an optimal routing tree problem (Q1123140) (← links)
- The maximum value problem and NP real numbers (Q1161742) (← links)
- Some observations on the probabilistic algorithms and NP-hard problems (Q1163371) (← links)
- Computational complexity of real functions (Q1171056) (← links)
- A note of best fractions of a computable real number (Q1201155) (← links)
- On the computational complexity of integral equations (Q1207544) (← links)
- In memoriam Ronald V. Book (1937--1997) (Q1276318) (← links)
- On the computability of fractal dimensions and Hausdorff measure (Q1295381) (← links)
- On the computational complexity of best Chebyshev approximations (Q1821775) (← links)
- Distinguishing conjunctive and disjunctive reducibilities by sparse sets (Q1823690) (← links)
- Computational complexity of fixed points and intersection points (Q1893076) (← links)
- On the longest circuit in an alterable digraph (Q1904653) (← links)
- On logarithmic-space computable real numbers (Q1935807) (← links)
- On continuous one-way functions (Q2220825) (← links)
- Competitive profit maximization in social networks (Q2404075) (← links)
- Centralized and decentralized rumor blocking problems (Q2410051) (← links)
- On the complexity of computing the Hausdorff distance (Q2434923) (← links)
- On the complexity of non-unique probe selection (Q2474080) (← links)
- Separating the low and high hierarchies by oracles (Q2638773) (← links)
- On the complexity of finding paths in a two-dimensional domain I: Shortest paths (Q3159412) (← links)
- On the definitions of some complexity classes of real numbers (Q3310597) (← links)
- On the computational complexity of ordinary differential equations (Q3328541) (← links)
- (Q3348420) (← links)
- On the Complexity of Learning Minimum Time-Bounded Turing Machines (Q3357539) (← links)
- Separating and collapsing results on the relativized probabilistic polynomial-time hierarchy (Q3474281) (← links)
