Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
We give an algorithm for the hidden subgroup problem for the dihedral group D_N, or equivalently the cyclic hidden shift problem… 
2011
2011
Time averaged distribution of a discrete-time quantum walk on the path
The discrete time quantum walk which is a quantum counterpart of random walk plays important roles in the theory of quantum… 
2005
2005
Lower bounds for external algebraic decision trees
We propose a natural extension of algebraic decision trees to the external-memory setting, where the cost of disk operations… 
Highly Cited
2002
Highly Cited
2002
Determinism versus Nondeterminism for Linear Time RAMs with Memory Restrictions
  • M. Ajtai
  • Journal of computer and system sciences (Print)
  • 2002
  • Corpus ID: 17991052
Our computational model is a random access machine with n read only input registers each containing c log n bits of information… 
2002
2002
Topological Lower Bounds on Algebraic Random Access Machines
We prove general lower bounds for set recognition on random access machines (RAMs) that operate on real numbers with algebraic… 
Highly Cited
1988
Highly Cited
1988
Near-optimal time-space tradeoff for element distinctness
  • A. Yao
  • [Proceedings ] 29th Annual Symposium on…
  • 1988
  • Corpus ID: 35711895
It was conjectured by A. Borodin et al. that to solve the element distinctness problem requires TS= Omega (n/sup 2/) on a… 
1988
1988
THE PARALLEL COMPLEXITY OF ELEMENT DISTINCTNESS IS f ( x / logn ) *
We consider the problem of element distinctness. Here n synchronized processors, each given an integer input, must decide whether… 
1987
1987
A Time-Space Tradeoff for Element Distinctness
In "A Time Space Tradeoff for Sorting on non-Oblivious Machines", Borodin et al. [B - 81] proved that to sort n elements requires… 
1984
1984
Applications of Ramsey's Theorem to Decision Trees Complexity (Preliminary Version)
Combinatorial techniques for extending lower bounds results for decision trees to general types of queries are presented. We… 
1981
1981
The effect of number of Hamiltonian paths on the complexity of a vertex-coloring problem
  • U. ManberM. Tompa
  • 22nd Annual Symposium on Foundations of Computer…
  • 1981
  • Corpus ID: 15454608
A generalization of Dobkin and Lipton's element uniqueness problem is introduced: for any fixed undirected graph G on vertex set… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)