The following pages link to Ryuhei Mori (Q2081635):
Displaying 10 items.
- Loop Calculus For Nonbinary Alphabets Using Concepts From Information Geometry (Q2978692) (← links)
- Source and Channel Polarization Over Finite Fields and Reed–Solomon Matrices (Q2986384) (← links)
- Effects of Single-Cycle Structure on Iterative Decoding of Low-Density Parity-Check Codes (Q2989457) (← links)
- Lower Bounds for CSP Refutation by SDP Hierarchies (Q4636475) (← links)
- Sum of squares lower bounds for refuting any CSP (Q4977967) (← links)
- Exponential-time quantum algorithms for graph coloring problems (Q5918508) (← links)
- Exponential-time quantum algorithms for graph coloring problems (Q5970782) (← links)
- Quantum Speedups for Dynamic Programming on n-Dimensional Lattice Graphs (Q6168468) (← links)
- A simple and fast algorithm for computing the \(N\)-th term of a linearly recurrent sequence (Q6538752) (← links)
- The numerical results for the complexity of the quantum algorithm for dynamic programming on n-dimensional lattice graph (Q6696119) (← links)
