Skip to search formSkip to main contentSkip to account menu

Collision problem

The r-to-1 collision problem is an important theoretical problem in complexity theory, quantum computing, and computational mathematics. The… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2018
Review
2018
As an active defense technique to change asymmetry in cyberattack-defense confrontation, moving target defense research has… 
Highly Cited
2011
Highly Cited
2011
We give an algorithm for the hidden subgroup problem for the dihedral group D_N, or equivalently the cyclic hidden shift problem… 
Highly Cited
2006
Highly Cited
2006
During the communication and interaction with a human using motions or gestures, a humanoid robot needs to not only look like a… 
Highly Cited
2005
Highly Cited
2005
In a multi-reader environment, RFID system performance will be limited by the reader collision problem. RFID readers use… 
Highly Cited
2003
Highly Cited
2003
We present the Colorwave algorithm, a simple, distributed, on-line algorithm for the reader collision problem in radio frequency… 
Highly Cited
2002
Highly Cited
2002
We introduce the reader collision problem, the problem of allocating frequencies over time to radio frequency identification… 
Highly Cited
2001
Highly Cited
2001
(MATH) The collision problem is to decide whether a function X: { 1,&ldots;,n} → { 1, &ldots;,n} is one-to-one or two-to-one… 
Highly Cited
1999
Highly Cited
1999
The article is an introduction to a new concept of assembly features able to support intelligent design and manufacturing of…