Skip to content
TILens What matters today in tech v0.3.2
Theme

Daily edition · Algorithms

The daily ledger

TILens turns technical updates into a focused daily brief: official releases, trusted reporting, and practitioner analysis, deduplicated and organized by topic.

21 Sep 2026 edition

44 articles · 3 sources · 44 papers ·

Top topics: Algorithms · AI

Algorithms

Fooling Thresholds of Halfspaces

arXiv:2609.21329v1 Announce Type: new Abstract: We initiate the study of constructing explicit pseudorandom generators for thresholds of halfspaces with seed length polylogarithmic in the number of halfspaces. This…

Source: arXiv cs.CC Minglong Qin, Penghui Yao, Mingnan Zhao, Haigang Zhou
Algorithms

CVP Is NP-Complete for Principal Cyclotomic Ideals

arXiv:2608.23828v2 Announce Type: replace Abstract: We prove that exact Euclidean decision-CVP is $\mathsf{NP}$-complete on the coefficient lattices of nonzero principal ideals in the power-of-two cyclotomic rings…

Source: arXiv cs.CC Jiaqi Liu, Yansong Feng, Yanbin Pan
Algorithms

On quantum functionals for higher-order tensors

arXiv:2604.18283v2 Announce Type: replace-cross Abstract: Upper and lower quantum functionals, introduced by Christandl, Vrana and Zuiddam (STOC 2018, J. Amer. Math. Soc. 2023), are families of monotone functions of…

Source: arXiv cs.CC Alonso Botero, Matthias Christandl, Thomas C. Fraser, Itai Leigh, Harold Nieuwboer
Algorithms

Restructuring Tree Decision Diagrams

arXiv:2609.21842v1 Announce Type: new Abstract: Tree Decision Diagrams (TDDs) are a data structure recently introduced by Capelli et al. (SAT 2026). They are structured along a vtree and the size of their canonical form…

Source: arXiv cs.CC Christoph Berkholz, Matth\"aus Micun, Igor Razgon
Algorithms

An elementary proof of the Koml\'os conjecture

arXiv:2609.20979v1 Announce Type: cross Abstract: We give an elementary proof of the Koml\'os conjecture by simplifying the recent proof of Guo, Fang, and Lu. We show that any vectors $v_1,\ldots,v_n\in\mathbb{R}^d$…

Source: arXiv cs.CC Sankeerth Rao Karingula, Shachar Lovett
Algorithms AI

Weighted Quantum Signal Processing: Low-Depth Polynomial Approximation with Applications to Kolmogorov-Arnold Networks

arXiv:2609.21567v1 Announce Type: cross Abstract: Quantum Signal Processing is a powerful quantum framework for generating and approximating univariate polynomials. However, QSP is often limited by circuit-depth…

Source: arXiv cs.CC Rohit Sarma Sarkar, Rupayan Bhattacharjee, Elias F. Combarro, Michele Grossi, Lirand\"e Pira, Carmen G. Almud\'ever, Sergi Abadal, Eduard Alarcon
Algorithms

Conjugator Length in Iterated Cyclic Amalgams of Free Groups

arXiv:2609.21116v1 Announce Type: cross Abstract: Let $\mathcal{A}_0$ be the set of finitely generated free groups on some countable alphabet and and define $\mathcal{A}_r$ inductively as the union of…

Source: arXiv cs.DM Conan Gillis
Algorithms

Tree-independence number of $P_5$-free graphs with no large bicliques

arXiv:2605.03965v2 Announce Type: replace-cross Abstract: The tree-independence number of a graph is the minimum, over all tree-decompositions of the graph, of the maximum size of an independent set contained in a bag.…

Source: arXiv cs.DM V\'aclav Bla\v{z}ej, J. Pascal Gollin, Tom\'a\v{s} Hons, Tom\'a\v{s} Masa\v{r}\'ik, Martin Milani\v{c}, Pawe{\l} Rz\k{a}\.zewski, Ond\v{r}ej Such\'y, Alexandra Wesolek
Algorithms

Best Matches in Phylogenetic Networks

arXiv:2609.21700v1 Announce Type: cross Abstract: Best match graphs (BMGs) were introduced in mathematical phylogenetics to describe the concept of closest relatives for related genes (leaves of rooted tree) in…

Source: arXiv cs.DM Patricia A. Ebert, Peter F. Stadler, Marc Hellmuth
Algorithms

Certificates for short extending words in a finite automaton

arXiv:2609.21603v1 Announce Type: cross Abstract: Let $\mathcal A$ be a complete deterministic finite automaton on a state set $Q$ of size $n$ with $k$ letters, and for a proper nonempty subset $S$ of $Q$ let…

Source: arXiv cs.DM Michele Miccinesi
Algorithms

Induced packing treewidth II. Excluding a clique or a biclique

arXiv:2609.21615v1 Announce Type: cross Abstract: The notion of induced packing treewidth aims to unify classes defined by forbidden induced subgraphs or induced minors with classes defined by the existence of certain…

Source: arXiv cs.DM Amir Nikabadi, Pawe{\l} Rz\k{a}\.zewski

Showing 1 day · 44 items available