scientific article; zbMATH DE number 6850464

zbMath1403.68325arXiv1801.02793MaRDI QIDQ4608050

Sepehr Assadi, Sanjeev Khanna

Publication date: 15 March 2018

Full work available at URL: https://arxiv.org/abs/1801.02793

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Distributed algorithms (68W15)

Related Items (3)

Equivalence classes and conditional hardness in massively parallel computations ⋮ The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs ⋮ Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem

This page was built for publication: