scientific article; zbMATH DE number 2083798

zbMATH Open1054.68060MaRDI QIDQ4739596FDOQ4739596

Juraj Hromkovič

Publication date: 6 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2264/22640001.htm

Title of this publication is not available (Why is that?)

zbMATH Keywords

communication complexityrandomized computingtwo-party protocols

Mathematics Subject Classification ID

Randomized algorithms (68W20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cited In (8)

• Randomized parallel communications on an extension of the omega network
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's
• Randomised Broadcasting: Memory vs. Randomness
• Title not available (Why is that?)
• The Power of Shared Randomness in Uncertain Communication
• On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes

   Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Information Transfer under Different Sets of Protocols 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4739596)