471 citations · 1.3k across the 58 of their papers we have counts for
Showing cs.AIShow all
3 papers · 1 filter
cs.AI2011★ 5 cited
Solving Highly Constrained Search Problems with Quantum Computers
T. Hogg
A previously developed quantum search algorithm for solving 1-SAT problems in a single step is generalized to apply to a range of highly constrained k-SAT problems. We identify a b…
cs.AI1997
A New Look at the Easy-Hard-Easy Pattern of Combinatorial Search Difficulty
D. L. Mammen, T. Hogg
The easy-hard-easy pattern in the difficulty of combinatorial search problems as constraints are added has been explained as due to a competition between the decrease in number of…
cs.AI1996
Quantum Computing and Phase Transitions in Combinatorial Search
T. Hogg
We introduce an algorithm for combinatorial search on quantum computers that is capable of significantly concentrating amplitude into solutions for some NP search problems, on aver…