Live briefing
Everything about Element distinctness problem
In computational complexity theory, the element distinctness problem or element uniqueness problem is the problem of determining whether all the elements of a list are distinct. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Element distinctness problemA 5-minute orientation
- Pick up a classic book: The influence of Greek ideas and usages upon the Christian churchThe most-reprinted book on the subject
- Read the landmark paper: Quantum lower bounds for the collision and the element distinctness problemsCited 167 times
- Go sideways: Quantum algorithmA closely related topic
- Go sideways: Decision tree modelA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
Quantum lower bounds for the collision and the element distinctness problems
A lower bound for the integer element distinctness problem
Optimal deterministic quantum algorithm for the promised element distinctness problem
The element distinctness problem on one-tape Turing machines
Bounds for the Element Distinctness Problem on one-tape Turing machines
đź“š Books worth reading
The influence of Greek ideas and usages upon the Christian churchEdwin Hatch · 1890
The death of ChristJames Denney · 1902
Cartesian meditationsEdmund Husserl, Dorion Cairns · 1960
Critical Community PsychologyCarolyn Kagan, Mark Burton · 2011
A Man in ChristJames S. Stewart · 1935
Political EconomyCharles S. Devas · 1892
The origin of ideasAntonio Rosmini · 1883
The Philosophical System Of Antonio Rosmini-SerbatiAntonio Rosmini · 1882
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Quantum algorithm In quantum computing, a quantum algorithm is an algorithm that runs on a realistic model of quantum computation, the most commonly used model being the…
- Decision tree model In computational complexity theory, the decision tree model is the model of computation in which an algorithm can be considered to be a decision tree,…
- Computational complexity In computer science, the computational complexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus…
- Time complexity In theoretical computer science, the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm…
- BHT algorithm In quantum computing, the Brassard–Høyer–Tapp (BHT) algorithm is a quantum algorithm that solves the collision problem. In this problem, one is given n…
- 3SUM In computational complexity theory, the 3SUM problem asks if a given set of n real numbers contains three elements that sum to zero. A generalized version…
- Aanderaa–Karp–Rosenberg conjecture Unsolved problem in computer science Prove or disprove Aanderaa–Karp–Rosenberg conjecture. More unsolved problems in computer science In theoretical computer…
- Computational complexity theory In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource…