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.

2008

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

2005

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

2003

This disclosure relates to a pipe and tubing connector adapted to quickly and easily connect unthreaded pipe to a hollow body…

2002

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

2000

We define a family of functions F from a domain U to a range R to be dispersing if for every set S ⊆ U of a certain size and…

1999

. In this paper we consider lower bounds for external-memory computational geometry problems. We (cid:12)nd that it is not quite…

1994

1988

We consider the problem of element distinctness. Here n synchronized processors, each given an integer input, must decide whether…

1988

We consider the problem of element distinctness. Here n synchronized processors, each given an integer input, must decide whether…

1984

Combinatorial techniques for extending lower bounds results for decision trees to general types of queries are presented. We…