scientific article; zbMATH DE number 6783373
From MaRDI portal
Publication:5365017
zbMath1373.68244MaRDI QIDQ5365017
Publication date: 29 September 2017
Full work available at URL: http://dl.acm.org/citation.cfm?id=2133038
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Enumeration in graph theory (05C30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (7)
Sublinear Estimation of Weighted Matchings in Dynamic Data Streams ⋮ Unnamed Item ⋮ Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph ⋮ Dynamic graph stream algorithms in \(o(n)\) space ⋮ Structural results on matching estimation with applications to streaming ⋮ Two Party Distribution Testing: Communication and Security ⋮ On Approximating Matrix Norms in Data Streams
This page was built for publication:
