From post

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

The Time Complexity of A* with Approximate Heuristics on Multiple-Solution Search Spaces., , , и . J. Artif. Intell. Res., (2012)The McEliece Cryptosystem Resists Quantum Fourier Sampling Attacks, , и . CoRR, (2010)Inconsistency versus Accuracy of Heuristics.. Canadian AI, том 8436 из Lecture Notes in Computer Science, стр. 71-82. Springer, (2014)On Achievable Rate and Ergodic Capacity of OAF Multiple-Relay Networks with CSI., , , , и . VTC Spring, стр. 1-6. IEEE, (2013)Quantum Fourier sampling, Code Equivalence, and the quantum security of the McEliece and Sidelnikov cryptosystems, , и . CoRR, (2011)McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks., , и . CRYPTO, том 6841 из Lecture Notes in Computer Science, стр. 761-779. Springer, (2011)Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs., и . APPROX-RANDOM, том 5171 из Lecture Notes in Computer Science, стр. 385-401. Springer, (2008)Optimality conditions and duality theorems for nonsmooth semi-infinite interval-valued mathematical programs with vanishing constraints., и . Comput. Appl. Math., (декабря 2022)Quantum and randomized lower bounds for local search on vertex-transitive graphs., и . Quantum Inf. Comput., 10 (7&8): 636-652 (2010)On the Value of Good Advice: The Complexity of A* Search with Accurate Heuristics., , и . AAAI, стр. 1140-1145. AAAI Press, (2007)