10 citations · 18 across the 5 of their papers we have counts for
5 papers
Inconsistency and Accuracy of Heuristics with A* Search
Hang Dinh, Hieu Dinh
Many studies in heuristic search suggest that the accuracy of the heuristic used has a positive impact on improving the performance of the search. In another direction, historical…
Quantum Fourier sampling, Code Equivalence, and the quantum security of the McEliece and Sidelnikov cryptosystems
Hang Dinh, Cristopher Moore, Alexander Russell
The Code Equivalence problem is that of determining whether two given linear codes are equivalent to each other up to a permutation of the coordinates. This problem has a direct re…
The McEliece Cryptosystem Resists Quantum Fourier Sampling Attacks
Hang Dinh, Cristopher Moore, Alexander Russell
Quantum computers can break the RSA and El Gamal public-key cryptosystems, since they can factor integers and extract discrete logarithms. If we believe that quantum computers will…
Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs
Hang Dinh, Alexander Russell
We study the problem of \emph{local search} on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a…
Serious Flaws in Korf et al.'s Analysis on Time Complexity of A*
Hang Dinh
This paper has been withdrawn.