In Memoriam: Ker-I Ko (1950–2018) (Q3297820)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	In Memoriam: Ker-I Ko (1950–2018)	scientific article

Statements

scholarly article

In Memoriam: Ker-I Ko (1950–2018) (English)

zbMATH Open document ID

10.1007/978-3-030-41672-0_1

Complexity and Approximation

publication date

20 July 2020

Mathematics Subject Classification ID

zbMATH DE Number

MaRDI profile type

MaRDI publication profile

full work available at URL

https://doi.org/10.1007/978-3-030-41672-0_1

Centralized and decentralized rumor blocking problems

Competitive profit maximization in social networks

An approximation algorithm for maximum weight budgeted connected set cover

On the complexity of computing the Hausdorff distance

On logarithmic-space computable real numbers

On parallel complexity of analytic functions

On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane

On the complexity of non-unique probe selection

Jordan Curves with Polynomial Inverse Moduli of Continuity

On the complexity of computing the logarithm and square root functions on a complex domain

Jordan curves with polynomial inverse moduli of continuity

On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain

The computational complexity of distance functions of two-dimensional domains

On the complexity of finding paths in a two-dimensional domain I: Shortest paths

A greedy approximation for minimum connected dominating sets

Special issue: Computability and complexity in analysis. Papers of a seminar, German Computer Science Center at Castle Dagstuhl, Germany, November 1999

On the computability of fractal dimensions and Hausdorff measure

Mt. Holyoke conference on continuous algorithms and complexity, June 11- 17, 1994, South Hadley, MA, USA

On the longest circuit in an alterable digraph

Computational Complexity of Two-Dimensional Regions

A polynomial-time computable curve whose interior has a nonrecursive measure

Instance complexity

On the computational complexity of integral equations

A note of best fractions of a computable real number

Three \(\sum^ P_ 2\)-complete problems in computational learning theory

Separating the low and high hierarchies by oracles

On the Complexity of Learning Minimum Time-Bounded Turing Machines

On adaptive versus nonadaptive bounded query machines

A note on separating the relativized polynomial time hierarchy by immune sets

Separating and collapsing results on the relativized probabilistic polynomial-time hierarchy

Distinguishing conjunctive and disjunctive reducibilities by sparse sets

Relativized Polynomial Time Hierarchies Having Exactly <i>K</i> Levels

On the complexity of an optimal routing tree problem

On Sets Truth-Table Reducible to Sparse Sets

Searching for Two Objects by Underweight Feedback

Identification of pattern languages from examples and queries

Some Completeness Results on Decision Trees and Group Testing

A note on the two-variable pattern-finding problem

On helping by robust oracle machines

Corrigenda to: ``On the continued fraction representation of computable real numbers''

Approximation to measurable functions and its relation to probabilistic computation

On the number of queries necessary to identify a permutation

On the computational complexity of best Chebyshev approximations

On one-way functions and polynomial-time isomorphisms

On the continued fraction representation of computable real numbers

On the notion of infinite pseudorandom sequences

Continuous optimization problems and a polynomial hierarchy of real functions

Nonlevelable sets and immune sets in the accepting density hierarchy inNP

On Circuit-Size Complexity and the Low Hierarchy in NP

On some natural complete operators

Reducibilities on real numbers

On the computational complexity of ordinary differential equations

On self-reducibility and weak P-selectivity

On the definitions of some complexity classes of real numbers

Some negative results on the computational complexity of total variation and differentiation

Some observations on the probabilistic algorithms and NP-hard problems

The maximum value problem and NP real numbers

Computational complexity of real functions

Completeness, Approximation and Density

Computing and Combinatorics

Some complexity issues on the simply connected regions of the two-dimensional plane

Design and analysis of approximation algorithms

Sitelinks

Mathematics(1 entry)

mardi Publication:3297820

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3297820&oldid=36601608"