English

Adversary Lower Bound for Element Distinctness

Quantum Physics 2012-04-24 v1 Computational Complexity

Abstract

In this note we construct an explicit optimal (negative-weight) adversary matrix for the element distinctness problem, given that the size of the alphabet is sufficiently large.

Cite

@article{arxiv.1204.5074,
  title  = {Adversary Lower Bound for Element Distinctness},
  author = {Aleksandrs Belovs},
  journal= {arXiv preprint arXiv:1204.5074},
  year   = {2012}
}

Comments

6 pages

R2 v1 2026-06-21T20:53:29.815Z