Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,302 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
12 relations
BHT algorithm
Boyer–Moore majority vote algorithm
Collision problem
Computational complexity theory
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Salient Region Detection Using Multilevel Image Features
Qi-chang Duan
,
Li Si
,
Mingxuan Mao
2016
Corpus ID: 63874930
In this paper, we propose a novel salient region detection approach. First, segment the original image into a set of superpixels…
Expand
2008
2008
On the influence of the ceiling profile on the distribution of the room acoustical parameters and the reverberation time
U. Stephenson
2008
Corpus ID: 52244443
Room acoustical parameters as the sound pressure level decay, the Deutlichkeit (distinctness), the EDT are influenced mainly by…
Expand
2005
2005
Lower bounds for external algebraic decision trees
Jeff Erickson
ACM-SIAM Symposium on Discrete Algorithms
2005
Corpus ID: 216397
We propose a natural extension of algebraic decision trees to the external-memory setting, where the cost of disk operations…
Expand
2003
2003
Quantum lower bounds for collision and element distinctness with small range
A. Ambainis
2003
Corpus ID: 214370
This disclosure relates to a pipe and tubing connector adapted to quickly and easily connect unthreaded pipe to a hollow body…
Expand
2002
2002
Topological Lower Bounds on Algebraic Random Access Machines
Amir M. Ben-Amram
,
Z. Galil
SIAM journal on computing (Print)
2002
Corpus ID: 207079013
We prove general lower bounds for set recognition on random access machines (RAMs) that operate on real numbers with algebraic…
Expand
1995
1995
Some Geometric Lower Bounds
H. Chien
,
W. Steiger
International Symposium on Algorithms and…
1995
Corpus ID: 9925539
Dobkin and Lipton introduced the connected components argument to prove lower bounds in the linear decision tree model for…
Expand
1994
1994
New Lower Bounds for Element Distinctness on a On-Tape Turing Machine
A. López-Ortiz
Information Processing Letters
1994
Corpus ID: 17189374
1988
1988
THE PARALLEL COMPLEXITY OF ELEMENT DISTINCTNESS IS f ( x / logn ) *
P. Ragde
,
W. Steiger
,
Endre SZEMERtDI
,
A. Wigderson
1988
Corpus ID: 18028491
We consider the problem of element distinctness. Here n synchronized processors, each given an integer input, must decide whether…
Expand
1988
1988
The Parallel Complexity of Element Distinctness is Omega (sqrt(log n))
P. Ragde
,
W. Steiger
,
E. Szemerédi
,
A. Wigderson
SIAM Journal on Discrete Mathematics
1988
Corpus ID: 40234297
We consider the problem of element distinctness. Here n synchronized processors, each given an integer input, must decide whether…
Expand
1984
1984
Applications of Ramsey's Theorem to Decision Trees Complexity (Preliminary Version)
S. Moran
,
M. Snir
,
U. Manber
IEEE Annual Symposium on Foundations of Computer…
1984
Corpus ID: 40227916
Combinatorial techniques for extending lower bounds results for decision trees to general types of queries are presented. We…
Expand
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)
ACCEPT & CONTINUE