Automata, Languages and Programming
From MaRDI portal
Publication:5716863
DOI10.1007/11523468zbMath1085.68053OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716863
Toniann Pitassi, Nathan Segerlind, P. W. Beame
Publication date: 10 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11523468
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Network protocols (68M12)
Related Items (2)
Hellinger volume and number-on-the-forehead communication complexity ⋮ Optimal collapsing protocol for multiparty pointer jumping
This page was built for publication: Automata, Languages and Programming