Ivan Mihajlin

activity

20132026

most citedFamilies with infants: a general approach to solve hard partition problems

2 citations · 3 across the 13 of their papers we have counts for

collaborators

Showing 2026 · cs.CCShow all

3 papers · 2 filters

cs.CC2026

Improved Quantum Algorithms for Subset Sum and $k$ -SUM

Nikolai Chukhin, Alexander S. Kulikov, Maksim Levitskii +1

The Subset Sum problem asks whether, given $n$ integers and a target, some subset of the integers sums to the target. Its best known worst-case running time is $O^{*} (2^{n /2})$ (Horo…

cs.CC2026

If Edge Coloring is Hard under SETH, then SETH is False

Alexander S. Kulikov, Ivan Mihajlin

The Edge Coloring problem is notoriously hard: it is still unknown whether it can be solved in time $2^{o (n^{2})}$ (let alone $2^{O (n)}$ ), where $n$ is the number of nodes of the inp…

cs.CC2026

Complexity of the Graph Homomorphism Problem w.r.t. Degeneracy

Grigorii Braulov, Nikolai Chukhin, Alexander S. Kulikov +1

The graph homomorphism problem HOM is: given an $n$ -vertex source graph $G$ and an $h$ -vertex target graph $H$ , is there a mapping from $V (G)$ to $V (H)$ that preserves edges? A str…

Improved Quantum Algorithms for Subset Sum and k-SUM

If Edge Coloring is Hard under SETH, then SETH is False

Complexity of the Graph Homomorphism Problem w.r.t. Degeneracy

Improved Quantum Algorithms for Subset Sum and $k$ -SUM