Q5158502 (Q5158502): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 22:16, 26 July 2024

scientific article; zbMATH DE number 7413503

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7413503

Statements

scholarly article

0 references

10.4086/toc.2021.v017a008

0 references

Dmitry Gavinsky

0 references

Theory of Computing

0 references

publication date

25 October 2021

0 references

full work available at URL

https://arxiv.org/abs/1811.04010

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

communication complexity

0 references

complexity classes

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

Lower Bounds on Information Transfer in Distributed Computations

0 references

Error-bounded probabilistic computations between MA and AM

0 references

On the Power of Statistical Zero Knowledge

0 references

0 references

0 references

Rectangles Are Nonnegative Juntas

0 references

Zero-information protocols and unambiguity in Arthur-Merlin communication

0 references

The landscape of communication complexity classes

0 references

Non-deterministic communication complexity with few witnesses

0 references

Communication Complexity

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5158502

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5158502&oldid=36724801"