Výsledky vyhledávání - "Complexity Measures and Problem Complexity"

LIPIcs, Volume 40, APPROX/RANDOM'15, Complete Volume

Autoři: Garg, Naveen Jansen, Klaus Rao, Anup a další

Přispěvatelé: Garg, Naveen Jansen, Klaus Rao, Anup a další

Témata: Data Structures, Coding and Information Theory, Theory of Computation, Computation by Abstract Devices, Modes of Computation, Complexity Measures and Problem Complexity, Numerical Algorithms and Problems, Nonnumerical Algorithms and Problems, Approximation, Numerical Linear Algorithms and Problems

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 40, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)

Dostupnost: https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015
https://nbn-resolving.org/urn:nbn:de:0030-drops-54012
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2015

LIPIcs, Volume 40, APPROX/RANDOM'15, Complete Volume

Autoři: Naveen Garg and Klaus Jansen and Anup Rao and José D. P. Rolim Garg, Naveen Jansen, Klaus a další

Témata: Data Structures, Coding and Information Theory, Theory of Computation, Computation by Abstract Devices, Modes of Computation, Complexity Measures and Problem Complexity, Numerical Algorithms and Problems, Nonnumerical Algorithms and Problems, Approximation, Numerical Linear Algorithms and Problems, Proceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2015
Is Part Of LIPIcs, Volume 40, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)