Encoding Hash Functions as a SAT Problem.
Florian LegendreGilles DequenMichaël KrajeckiPublished in: ICTAI (2012)
Keyphrases
- hash functions
- sat problem
- satisfiability problem
- sat solvers
- constraint satisfaction problems
- phase transition
- np complete
- similarity search
- max sat
- boolean satisfiability
- sat instances
- randomly generated
- locality sensitive
- random sat instances
- propositional satisfiability
- hashing algorithm
- hamming distance
- decision problems
- order preserving
- sat encodings
- nearest neighbor search
- weighted max sat
- neural network
- locality sensitive hashing
- branch and bound
- constraint satisfaction
- high dimensional
- hamming space
- search algorithm
- binary codes
- hashing methods
- data distribution
- search space