Minki Hhan

activity

20232026

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2026

Finding a Shortest Vector and More in $2^{n /2 + o (n)}$ Time using $q$ -ary Coset Difference Tree

Minki Hhan

This paper presents a new randomized algorithm for solving the exact shortest vector problem. For the $n$ -dimensional lattice $L$ , our algorithm runs in time and space $2^…

cs.DS2026

Solving the Shortest Vector Problem in $2^{0.6039 n}$ Time via Mid-point Hessian

Minki Hhan

We present randomized algorithms for the shortest vector problem (SVP). For the $n$ -dimensional lattice $L$ , our algorithms solve SVP in time $2^{0.6039 n + o (n)}$ classicall…

cs.DS2025

Computing and Bounding Equilibrium Concentrations in Athermic Chemical Systems

Hamidreza Akef, Minki Hhan, David Soloveichik

Computing equilibrium concentrations of molecular complexes is generally analytically intractable and requires numerical approaches. In this work we focus on the polymer-monomer le…

Finding a Shortest Vector and More in 2n/2+o(n) Time using q-ary Coset Difference Tree

Solving the Shortest Vector Problem in 20.6039n Time via Mid-point Hessian

Computing and Bounding Equilibrium Concentrations in Athermic Chemical Systems

Finding a Shortest Vector and More in $2^{n /2 + o (n)}$ Time using $q$ -ary Coset Difference Tree

Solving the Shortest Vector Problem in $2^{0.6039 n}$ Time via Mid-point Hessian