( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Exponential-Time Quantum Algorithms for Graph Coloring Problems.

, и . LATIN, том 12118 из Lecture Notes in Computer Science, стр. 387-398. Springer, (2020)

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.

Ryoko Mori

Takahito Mori

Magnus Mori

Hisako Mori

Taro Mori

 

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

Channel polarization on q-ary discrete memoryless channels by arbitrary kernels., и . ISIT, стр. 894-898. IEEE, (2010)Finite-length analysis of irregular expurgated LDPC codes under finite number of iterations., , , и . ISIT, стр. 2497-2501. IEEE, (2009)Asymptotic bit error probability of LDPC codes for the binary erasure channel with finite number of iterations., , , и . ISIT, стр. 449-453. IEEE, (2008)Central approximation in statistical physics and information theory., и . ISIT, стр. 1652-1656. IEEE, (2012)Holographic transformation, belief propagation and loop calculus for generalized probabilistic theories.. ISIT, стр. 1099-1103. IEEE, (2015)Non-binary polar codes using Reed-Solomon codes and algebraic geometry codes., и . ITW, стр. 1-5. IEEE, (2010)Exponential-Time Quantum Algorithms for Graph Coloring Problems., и . LATIN, том 12118 из Lecture Notes in Computer Science, стр. 387-398. Springer, (2020)Performance and construction of polar codes on symmetric binary-input memoryless channels., и . ISIT, стр. 1496-1500. IEEE, (2009)Quantum supremacy and hardness of estimating output probabilities of quantum circuits., , и . FOCS, стр. 1296-1307. IEEE, (2021)Exponential-Time Quantum Algorithms for Graph Coloring Problems., и . Algorithmica, 84 (12): 3603-3621 (2022)