scientific article; zbMATH DE number 7413503

DOI10.4086/toc.2021.v017a008OpenAlexW3201898472MaRDI QIDQ5158502

Dmitry Gavinsky

Publication date: 25 October 2021

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.04010

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

zbMATH Keywords

communication complexitycomplexity classes

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Zero-information protocols and unambiguity in Arthur-Merlin communication
• Non-deterministic communication complexity with few witnesses
• The landscape of communication complexity classes
• Error-bounded probabilistic computations between MA and AM
• Algebrization
• Lower Bounds on Information Transfer in Distributed Computations
• Communication Complexity
• On the Power of Statistical Zero Knowledge
• Rectangles Are Nonnegative Juntas

This page was built for publication: