Publication
A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem
Jan 1, 2010 · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · Citations: 44
Rustem Takhanov
@k-nicConnected with DSML. This person's Telegram account has been confirmed through DSML Kazakhstan.
Rustem Takhanov is a mathematician at Nazarbayev University whose research spans discrete geometry, combinatorics, optimization, machine learning theory, and theoretical computer science.
Open to
Project collaborationResearch collaboration
Featured
Publication
Fourier neural networks: A comparative study - INTELLIGENT DATA ANALYSIS, 2020
2020 · Intelligent Data Analysis · Citations: 28
Publication
Syllable-aware Neural Language Models: A Failure to Beat Character-aware Ones
Jan 1, 2017 · Conference on Empirical Methods in Natural Language Processing (EMNLP) · Citations: 16
Publication
Extensions of the Minimum Cost Homomorphism Problem
Jan 1, 2010 · Lecture notes in computer science · Citations: 15
About
His recent work focuses on high-dimensional kissing arrangements and sphere packings. In 2026, together with collaborators, he constructed a configuration of 841 spheres kissing a central sphere in 12-dimensional Euclidean space, improving a lower bound that had stood since the work of Leech and Sloane in 1971.