scientific article; zbMATH DE number 6469208
From MaRDI portal
Publication:5501326
zbMath1318.68097MaRDI QIDQ5501326
No author found.
Publication date: 3 August 2015
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)
Related Items (6)
Oblivious key-value stores and amplification for private set intersection ⋮ Hardness of peeling with stashes ⋮ Unnamed Item ⋮ Pruning processes and a new characterization of convex geometries ⋮ Simple multi-party set reconciliation ⋮ A novel giant-subgraph phase-transition in sparse random \(k\)-partite graphs
This page was built for publication: