Communication Complexity and Graph Families

DOI10.1145/3313234zbMath1485.68098OpenAlexW3027222722MaRDI QIDQ5205796

Fahad Panolan, Saket Saurabh, Sudeshna Kolay

Publication date: 16 December 2019

Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3313234

zbMATH Keywords

separating familycommunication complexityFPT algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27) Communication complexity, information complexity (68Q11)

This page was built for publication: Communication Complexity and Graph Families