Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,333,396 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.
2018
2018
Computing the Planar $\beta$-skeleton Depth
Rasoul Shahsavarifar
,
David Bremner
2018
Corpus ID: 3952232
For $\beta \geq 1$, the \emph{$\beta$-skeleton depth} ($\SkD_\beta$) of a query point $q\in \mathbb{R}^d$ with respect to a…
Expand
2017
2017
An Optimal Algorithm for Computing the Spherical Depth of Points in the Plane
David Bremner
,
Rasoul Shahsavarifar
arXiv.org
2017
Corpus ID: 17173500
For a distribution function $F$ on $\mathbb{R}^d$ and a point $q\in \mathbb{R}^d$, the \emph{spherical depth} $\SphD(q;F)$ is…
Expand
2016
2016
Религия и искусство: ислам
Тульпе Ирина Александровна
2016
Corpus ID: 193686716
The object of this article is the problem of connection between religion and art, Islamic visual art being its subject. The…
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
2006
2006
Principle of the Identification for the Fourth Harmonic Element Uniqueness
Meng Ling-jiang
2006
Corpus ID: 124196094
During the process of the identification for the fourth harmonic point,the usage of any element will not affect its uniqueness…
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
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