
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.
Es wurden noch keine Bewertungen abgegeben. Schreiben Sie die erste Bewertung zu "Complexity and Approximation" und helfen Sie damit anderen bei der Kaufentscheidung.