Ryuhei Mori

1. Lower bounds for CSP refutation by SDP hierarchies
   2016/10/10 by Ryuhei Mori, Mori, Ryuhei, David Witmer +1 · 2 citations
   Computer Science · #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Cryptography and Data Security #FOS: Computer and information sciences #Logic, Reasoning, and Knowledge
2. Channel Polarization on q-ary Discrete Memoryless Channels by Arbitrary Kernels
   2010/01/15 by Ryuhei Mori, Mori, Ryuhei, Toshiyuki Tanaka +1 · 3 citations
   Computer Science · #Cellular Automata and Applications #Coding theory and cryptography #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT)
3. Source and Channel Polarization over Finite Fields and Reed-Solomon Matrices
   2012/11/22 by Ryuhei Mori, Mori, Ryuhei, Toshiyuki Tanaka +1 · 1 citation
   Computer Science · #Coding theory and cryptography #Cooperative Communication and Network Coding #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT)
4. Complexity of graph-state preparation by Clifford circuits
   2024/02/08 by Soh Kumabe, Ryuhei Mori, Kumabe, Soh +3 · 2 voices · 2 citations
   Computer Science · Materials Science · #Machine Learning in Materials Science #Quantum Computing Algorithms and Architecture #Quantum-Dot Cellular Automata