scientific article; zbMATH DE number 6820278

DOI10.4230/LIPIcs.ICALP.2016.89zbMath1388.68121MaRDI QIDQ4598229

Amir Yehudayoff, Pavel Hrubeš

Publication date: 19 December 2017

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

zbMATH Keywords

isoperimetryseparationscommunication complexitymonotone computation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

Quadratic lower bounds for algebraic branching programs and formulas ⋮ Incremental versus non-incremental dynamic programming ⋮ The one-visibility localization game ⋮ Monotone arithmetic complexity of graph homomorphism polynomials ⋮ Unnamed Item ⋮ A quadratic lower bound for algebraic branching programs

This page was built for publication: