In computational complexity theory, the element distinctness problem or element uniqueness problem is the problem of determining whether all theâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2014

2014

- Ansis Rosmanis
- Chicago J. Theor. Comput. Sci.
- 2014

The ELEMENT DISTINCTNESS problem is to decide whether each character of an input string is unique. The quantum query complexityâ€¦Â (More)

Is this relevant?

2013

2013

- Paul Beame, RaphaÃ«l Clifford, Widad Machmouchi
- 2013 IEEE 54th Annual Symposium on Foundations ofâ€¦
- 2013

We derive new time-space tradeoff lower bounds and algorithms for exactly computing statistics of input data, including frequencyâ€¦Â (More)

Is this relevant?

2012

2012

- Aleksandrs Belovs
- ArXiv
- 2012

In this note we construct an explicit optimal (negative-weight) adversary matrix for the element distinctness problem, given thatâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Andris Ambainis
- 45th Annual IEEE Symposium on Foundations ofâ€¦
- 2004

We use quantum walks to construct a new quantum algorithm for element distinctness and its generalization. For elementâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- Yaoyun Shi
- FOCS
- 2002

Given a function <i>f</i> as an oracle, the collision problem is to find two distinct indexes <i>i</i> and <i>j</i> such that <iâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- Harry Buhrman, Christoph DÃ¼rr, +4 authors Ronald de Wolf
- IEEE Conference on Computational Complexity
- 2001

We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unorderedâ€¦Â (More)

Is this relevant?

2001

2001

- Peter HÃ¸yer, Jan Neerbek, Yaoyun Shi
- Algorithmica
- 2001

Abstract. We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-orderedâ€¦Â (More)

Is this relevant?

1988

1988

- Andrew Chi-Chih Yao
- FOCS
- 1988

It was conjectured in Borodin et al. [J. Comput. System Sci., 22 (1981), pp. 351-364] that to solve the element distinctnessâ€¦Â (More)

Is this relevant?

1986

1986

In a time-space tradeoff for sorting on non-oblivious machines, Borodin et. Al. [J. Comput. System Sci., 22(1981), pp. 351-364â€¦Â (More)

Is this relevant?

1986

1986

- Mauricio Karchmer
- Theor. Comput. Sci.
- 1986

Two time-space tradeoffs for element distinctness are given. The first one shows T2S = fl(n 3) on a branching program usingâ€¦Â (More)

Is this relevant?