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…

Papers overview

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

2018

For $\beta \geq 1$, the \emph{$\beta$-skeleton depth} ($\SkD_\beta$) of a query point $q\in \mathbb{R}^d$ with respect to a…

2016

The object of this article is the problem of connection between religion and art, Islamic visual art being its subject. The…

2016

Given a list 〈x1, . . . , xN 〉, with x1, . . . , xN ∈ {1, . . . ,M}, the problem of element distinctness consists in deciding if…

2015

Quantum computing became a prominent area of research with publications such as Feynman’s 1986 paper suggesting a construction…

2009

We study quantum algorithms for testing properties of sparse graphs. Let G be a boundeddegree graph on N vertices. Given an…

2008

Room acoustical parameters as the sound pressure level decay, the Deutlichkeit (distinctness), the EDT are influenced mainly by…

2006

During the process of the identification for the fourth harmonic point,the usage of any element will not affect its uniqueness…

2005

We propose a natural extension of algebraic decision trees to the external-memory setting, where the cost of disk operations…

2002

We prove general lower bounds for set recognition on random access machines (RAMs) that operate on real numbers with algebraic…

1983

A topological method is given for obtaining lower bounds for the height of algebraic computation trees, and algebraic decision…