Live briefing
Everything about Collision problem
Theoretical problem
The r-to-1 collision problem is an important theoretical problem in complexity theory, quantum computing, and computational mathematics. The collision problem most often refers to the 2-to-1 version: given even and a function, we are promised that f is either 1-to-1 or 2-to-1. We are only allowed to make queries about the value of for any. The problem then asks how many such queries we need to make to determine with certainty whether f is 1-to-1 or 2-to-1. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Collision problemA 5-minute orientation
- Skim a recent paper: Multi-objective optimization for energy-efficient flow shop scheduling problem with blocking and collision-free transportation constraintsInfluential work since 2022
- Pick up a classic book: Fragmentation ProcessesThe most-reprinted book on the subject
- Read the landmark paper: Triple collision in the collinear three-body problemCited 316 times
- Go sideways: BHT algorithmA closely related topic
- Go sideways: Simon's problemA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Triple collision in the collinear three-body problem
Solving the collision detection problem
Triple collision in the planar isosceles three body problem
Collision orbits in the anisotropic Kepler problem
The Water Drop Rebound Problem: Dynamics of Collision
Cooperative strategy for pursuit-evasion problem with collision avoidance
The three-body problem near triple collision
A collision problem in the wave mechanics
🆕 Influential since 2022
Multi-objective optimization for energy-efficient flow shop scheduling problem with blocking and collision-free transportation constraints
Efficient Industrial Solution for Robotic Task Sequencing Problem With Mutual Collision Avoidance & Cycle Time Optimization
Computer assisted proofs for transverse collision and near collision orbits in the restricted three body problem
Flocking and collision avoidance problem of a singular Cucker–Smale model with external perturbations
Collision avoidance approaches for autonomous mobile robots to tackle the problem of pedestrians roaming on campus road
📚 Books worth reading
- 📕Fragmentation ProcessesColm T. Whelan · 2012
Contact problems in elasticityN. Kikuchi, J. Tinsley Oden · 1988
Collisions, rings, and other Newtonian N-body problemsD. Saari · 2005- 📕Factorability and the nuclear three-body problemL. P. Kok · 1969
- 📕Proceedings; Meribel-lès-Allues (France) March 5-17, 1972Rencontre de Moriond (7th 1972 Méribel, France) · 1972
- 📕Parametryzacja macierzy przejścia dla procesów wielociałowychTomasz Hofmokl · 1971
Atomno-molekuli͡a︡rnye prot͡s︡essyE. E. Nikitin · 1988- 📕Scientific report on "Longitudinal waves in a plasma half space"W. M. Black · 1967
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- 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…
- Simon's problem In computational complexity theory and quantum computing, Simon's problem is a computational problem that is proven to be solved exponentially faster on…
- PP (complexity) In complexity theory, PP, or PPT is the class of decision problems solvable by a probabilistic Turing machine in polynomial time with an error probability…
- Hidden subgroup problem The hidden subgroup problem (HSP) is a topic of research in mathematics and theoretical computer science. It is a generalization of problems including…
- 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,…
- Ring learning with errors In post-quantum cryptography, ring learning with errors (RLWE) is a computational problem which serves as the foundation of new cryptographic algorithms…
- Bernstein–Vazirani algorithm The Bernstein–Vazirani algorithm, which solves the Bernstein–Vazirani problem, is a quantum algorithm invented by Ethan Bernstein and Umesh Vazirani in…
- Elliptic curve only hash The elliptic curve only hash (ECOH) algorithm was submitted as a candidate for SHA-3 in the NIST hash function competition. However, it was rejected in…