FAQ

Element distinctness problem

Known as: Element distinctness, Element uniqueness, Element uniqueness problem 
In computational complexity theory, the element distinctness problem or element uniqueness problem is the problem of determining whether all the… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1979-2018
024619792018

Related topics

Related topics

12 relations
BHT algorithmBoyer–Moore majority vote algorithmCollision problemComputational complexity theory
(More)

Related mentions per year

Related mentions per year

1936-2019
19401960198020002020
Element distinctness problem
Time complexity
Computational complexity theory
Sorting
Randomized algorithm
Model of computation

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Quantum Adversary Lower Bound for Element Distinctness with Small Range
The ELEMENT DISTINCTNESS problem is to decide whether each character of an input string is unique. The quantum query complexity… (More)
  • figure 1
Is this relevant?
2013
2013
Element Distinctness, Frequency Moments, and Sliding Windows
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
Adversary Lower Bound for Element Distinctness
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
Quantum walk algorithm for element distinctness
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
Quantum Lower Bounds for the Collision and the Element Distinctness Problems
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
Quantum Algorithms for Element Distinctness
We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered… (More)
Is this relevant?
2001
2001
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness
Abstract. We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered… (More)
  • figure 1
Is this relevant?
1988
1988
Near-Optimal Time-Space Tradeoff for Element Distinctness
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
A Time-Space Tradeoff for Element Distinctness
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
Two Time-Space Tradeoffs for Element Distinctness
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?