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

From MaRDI portal

Jump to:navigation, search

scientific article

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

Statements

scholarly article

0 references

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

0 references

zbMATH Open document ID

0 references

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

0 references

0 references

0 references

Complexity and Approximation

0 references

publication date

20 July 2020

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

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

0 references

0 references

Centralized and decentralized rumor blocking problems

0 references

Competitive profit maximization in social networks

0 references

An approximation algorithm for maximum weight budgeted connected set cover

0 references

On the complexity of computing the Hausdorff distance

0 references

On logarithmic-space computable real numbers

0 references

On parallel complexity of analytic functions

0 references

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

0 references

On the complexity of non-unique probe selection

0 references

Jordan Curves with Polynomial Inverse Moduli of Continuity

0 references

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

0 references

Jordan curves with polynomial inverse moduli of continuity

0 references

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

0 references

The computational complexity of distance functions of two-dimensional domains

0 references

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

0 references

A greedy approximation for minimum connected dominating sets

0 references

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

0 references

On the computability of fractal dimensions and Hausdorff measure

0 references

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

0 references

On the longest circuit in an alterable digraph

0 references

Computational Complexity of Two-Dimensional Regions

0 references

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

0 references

Instance complexity

0 references

On the computational complexity of integral equations

0 references

A note of best fractions of a computable real number

0 references

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

0 references

Separating the low and high hierarchies by oracles

0 references

On the Complexity of Learning Minimum Time-Bounded Turing Machines

0 references

On adaptive versus nonadaptive bounded query machines

0 references

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

0 references

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

0 references

Distinguishing conjunctive and disjunctive reducibilities by sparse sets

0 references

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

0 references

On the complexity of an optimal routing tree problem

0 references

0 references

On Sets Truth-Table Reducible to Sparse Sets

0 references

Searching for Two Objects by Underweight Feedback

0 references

Identification of pattern languages from examples and queries

0 references

Some Completeness Results on Decision Trees and Group Testing

0 references

A note on the two-variable pattern-finding problem

0 references

On helping by robust oracle machines

0 references

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

0 references

Approximation to measurable functions and its relation to probabilistic computation

0 references

On the number of queries necessary to identify a permutation

0 references

On the computational complexity of best Chebyshev approximations

0 references

On one-way functions and polynomial-time isomorphisms

0 references

On the continued fraction representation of computable real numbers

0 references

On the notion of infinite pseudorandom sequences

0 references

Continuous optimization problems and a polynomial hierarchy of real functions

0 references

Nonlevelable sets and immune sets in the accepting density hierarchy inNP

0 references

On Circuit-Size Complexity and the Low Hierarchy in NP

0 references

On some natural complete operators

0 references

Reducibilities on real numbers

0 references

On the computational complexity of ordinary differential equations

0 references

On self-reducibility and weak P-selectivity

0 references

On the definitions of some complexity classes of real numbers

0 references

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

0 references

Some observations on the probabilistic algorithms and NP-hard problems

0 references

The maximum value problem and NP real numbers

0 references

Computational complexity of real functions

0 references

Completeness, Approximation and Density

0 references

0 references

Computing and Combinatorics

0 references

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

0 references

0 references

0 references

0 references

0 references

0 references

Design and analysis of approximation algorithms

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3297820

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