Hugendubel.info - Die B2B Online-Buchhandlung 

Merkliste
Die Merkliste ist leer.
Bitte warten - die Druckansicht der Seite wird vorbereitet.
Der Druckdialog öffnet sich, sobald die Seite vollständig geladen wurde.
Sollte die Druckvorschau unvollständig sein, bitte schliessen und "Erneut drucken" wählen.

Complexity and Approximation

In Memory of Ker-I Ko
BuchKartoniert, Paperback
289 Seiten
Englisch
Springererschienen am21.02.20201st ed. 2020
This Festschrift is in honor of Ker-I Ko, Professor in the Stony Brook University, USA. He contributed signiï¬cantly to advancing the theory of structural complexity, especially on polynomial-time isomorphism, instance complexity, and relativization of polynomial-time hierarchy.mehr
Verfügbare Formate
BuchKartoniert, Paperback
EUR69,54
E-BookPDF1 - PDF WatermarkE-Book
EUR69,54

Produkt

KlappentextThis Festschrift is in honor of Ker-I Ko, Professor in the Stony Brook University, USA. He contributed signiï¬cantly to advancing the theory of structural complexity, especially on polynomial-time isomorphism, instance complexity, and relativization of polynomial-time hierarchy.
Details
ISBN/GTIN978-3-030-41671-3
ProduktartBuch
EinbandartKartoniert, Paperback
Verlag
Erscheinungsjahr2020
Erscheinungsdatum21.02.2020
Auflage1st ed. 2020
ReiheTheoretical Computer Science and General Issues
Seiten289 Seiten
SpracheEnglisch
Gewicht458 g
IllustrationenX, 289 p. 42 illus., 25 illus. in color.
Artikel-Nr.47912744

Inhalt/Kritik

Inhaltsverzeichnis
In Memoriam: Ker-I Ko (1950-2018).- Ker-I Ko and the Study of Resource-Bounded Kolmogorov Complexity.- The Power of Self-Reducibility Selectivity, Information, and Approximation.- Who Asked Us - How the Theory of Computing Answers, QuestionsAbout Analysis.- Promise Problems on Probability Distributions.- On Nonadaptive Reductions to the Set of Random Strings and its Dense Subsets.- Computability of the Solutions to Navier-Stokes Equations via Recursive Approximation.- Automatic Generation of Structured Overviews over a Very Large Corpus of Documents.- Better Upper Bounds for Searching on a Line with Byzantine Robots.- A Survey on Double Greedy Algorithms for Maximizing Non-monotone Submodular Functions.- Sequential Location Game on Continuous Directional Star Networks.- Core Decomposition, Maintenance and Applications.- Active and Busy Time Scheduling Problem: a Survey.- A Note on the Position Value for Hypergraph Communication Situations.- An Efficient Approximation Algorithm for the Steiner Tree Problem.- A Review for Submodular Optimization on Machine Scheduling Problems.- Edge Computing Integrated with Blockchain Technologies.mehr

Schlagworte