Element distinctness problem
Semantic Scholar uses AI to extract papers important to this topic.
- Chicago J. Theor. Comput. Sci.
The ELEMENT DISTINCTNESS problem is to decide whether each character of an input string is unique. The quantum query complexity… (More)
We derive new time-space tradeoff lower bounds and algorithms for exactly computing statistics of input data, including frequency… (More)
In this note we construct an explicit optimal (negative-weight) adversary matrix for the element distinctness problem, given that… (More)
We use quantum walks to construct a new quantum algorithm for element distinctness and its generalization. For element… (More)
Given a function <i>f</i> as an oracle, the collision problem is to find two distinct indexes <i>i</i> and <i>j</i> such that <i… (More)
- IEEE Conference on Computational Complexity
We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered… (More)
Abstract. We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered… (More)
It was conjectured in Borodin et al. [J. Comput. System Sci., 22 (1981), pp. 351-364] that to solve the element distinctness… (More)
In a time-space tradeoff for sorting on non-oblivious machines, Borodin et. Al. [J. Comput. System Sci., 22(1981), pp. 351-364… (More)
Two time-space tradeoffs for element distinctness are given. The first one shows T2S = fl(n 3) on a branching program using… (More)