scientific article; zbMATH DE number 1263236

zbMath0926.94022MaRDI QIDQ4234109

Dana Ron, Ilan Kremer, Noam Nisan

Publication date: 16 March 1999

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

zbMATH Keywords

combinatorial dimensionVapnik-Chervonenkis dimensionrandomized one-round communication complexitypublic-coin communication complexity

Mathematics Subject Classification ID

Cryptography (94A60) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (14)

On the Complexity of the Hidden Weighted Bit Function for Various BDD Models ⋮ Approximating Boolean functions by OBDDs ⋮ The minrank of random graphs ⋮ Multipartite quantum correlation and communication complexities ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Public vs. private randomness in simultaneous multi-party communication complexity ⋮ New bounds on classical and quantum one-way communication complexity ⋮ Verifiable Stream Computation and Arthur--Merlin Communication ⋮ Public vs. Private Randomness in Simultaneous Multi-party Communication Complexity ⋮ Lower bounds in communication complexity based on factorization norms ⋮ The Complexity of Differential Privacy ⋮ Streaming dictionary matching with mismatches

This page was built for publication: