The lazy adversary conjecture fails

DOI10.1007/S00224-004-1137-7zbMATH Open1093.68144OpenAlexW2003494082WikidataQ123181598 ScholiaQ123181598MaRDI QIDQ706320

Enoch Peserico

Publication date: 8 February 2005

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

Full work available at URL: https://doi.org/10.1007/s00224-004-1137-7

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Randomized algorithms (68W20)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A computational interpretation of Dolev-Yao adversaries 👍 👎
• Attacking group protocols by refuting incorrect inductive conjectures 👍 👎
• The linear-array conjecture in communication complexity is false 👍 👎
• Adversary lower bound for the k-sum problem 👍 👎
• The isomorphism conjecture fails relative to a random oracle 👍 👎
• An Asynchronous Computability Theorem for Fair Adversaries 👍 👎

This page was built for publication: The lazy adversary conjecture fails

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