In Memoriam: Ker-I Ko (1950–2018)
From MaRDI portal
Publication:3297820
DOI10.1007/978-3-030-41672-0_1zbMath1437.01029OpenAlexW3013649354WikidataQ113456023 ScholiaQ113456023MaRDI QIDQ3297820
Publication date: 20 July 2020
Published in: Complexity and Approximation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-41672-0_1
Cites Work
- An approximation algorithm for maximum weight budgeted connected set cover
- On parallel complexity of analytic functions
- The computational complexity of distance functions of two-dimensional domains
- Design and analysis of approximation algorithms
- A polynomial-time computable curve whose interior has a nonrecursive measure
- Three \(\sum^ P_ 2\)-complete problems in computational learning theory
- A greedy approximation for minimum connected dominating sets
- Reducibilities on real numbers
- On adaptive versus nonadaptive bounded query machines
- On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain
- On the complexity of computing the logarithm and square root functions on a complex domain
- Jordan curves with polynomial inverse moduli of continuity
- On self-reducibility and weak P-selectivity
- On some natural complete operators
- Continuous optimization problems and a polynomial hierarchy of real functions
- Approximation to measurable functions and its relation to probabilistic computation
- On the notion of infinite pseudorandom sequences
- On the continued fraction representation of computable real numbers
- Corrigenda to: ``On the continued fraction representation of computable real numbers
- On one-way functions and polynomial-time isomorphisms
- On helping by robust oracle machines
- Identification of pattern languages from examples and queries
- A note on the two-variable pattern-finding problem
- On the complexity of an optimal routing tree problem
- The maximum value problem and NP real numbers
- Some observations on the probabilistic algorithms and NP-hard problems
- Computational complexity of real functions
- A note of best fractions of a computable real number
- On the computational complexity of integral equations
- On the computability of fractal dimensions and Hausdorff measure
- Special issue: Computability and complexity in analysis. Papers of a seminar, German Computer Science Center at Castle Dagstuhl, Germany, November 1999
- On the computational complexity of best Chebyshev approximations
- Distinguishing conjunctive and disjunctive reducibilities by sparse sets
- Mt. Holyoke conference on continuous algorithms and complexity, June 11- 17, 1994, South Hadley, MA, USA
- On the longest circuit in an alterable digraph
- On logarithmic-space computable real numbers
- Competitive profit maximization in social networks
- Centralized and decentralized rumor blocking problems
- On the complexity of computing the Hausdorff distance
- On the complexity of non-unique probe selection
- Separating the low and high hierarchies by oracles
- On the complexity of finding paths in a two-dimensional domain I: Shortest paths
- On the definitions of some complexity classes of real numbers
- On the computational complexity of ordinary differential equations
- On the Complexity of Learning Minimum Time-Bounded Turing Machines
- Separating and collapsing results on the relativized probabilistic polynomial-time hierarchy
- A note on separating the relativized polynomial time hierarchy by immune sets
- Some negative results on the computational complexity of total variation and differentiation
- On Circuit-Size Complexity and the Low Hierarchy in NP
- Nonlevelable sets and immune sets in the accepting density hierarchy inNP
- On the number of queries necessary to identify a permutation
- Searching for Two Objects by Underweight Feedback
- Some Completeness Results on Decision Trees and Group Testing
- On Sets Truth-Table Reducible to Sparse Sets
- Completeness, Approximation and Density
- Instance complexity
- Relativized Polynomial Time Hierarchies Having Exactly K Levels
- Computational Complexity of Two-Dimensional Regions
- On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane
- Jordan Curves with Polynomial Inverse Moduli of Continuity
- Some complexity issues on the simply connected regions of the two-dimensional plane
- Computing and Combinatorics
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: In Memoriam: Ker-I Ko (1950–2018)
