Daily edition · Algorithms
TILens turns technical updates into a focused daily brief: official releases, trusted reporting, and practitioner analysis, deduplicated and organized by topic.
45 articles · 3 sources · 45 papers ·
Top topics: Algorithms
arXiv:2608.23929v1 Announce Type: cross Abstract: We study the approximation of the number of solutions of Laurent polynomials over finite fields. For a Laurent polynomial \[f(x)=\sum_{j=1}^{s}a_jx^{u_j}\in…
arXiv:1601.04794v2 Announce Type: replace Abstract: A new framework is developed for studying phase transitions in CSPs. Motivated by phase transition problems in CSPs, we prove a more general concentration inequality…
arXiv:2608.24601v1 Announce Type: cross Abstract: Many problems in the verification of recursive programs can be reduced to pushdown model checking. In this problem, we are given as input a pushdown automaton (PDA) over…
arXiv:2608.24257v1 Announce Type: cross Abstract: The Post Correspondence Problem is as follows: having a set of dominoes, is there any (maybe repeating) sequence of them such that the words formed by the upper parts…
arXiv:2604.15248v2 Announce Type: replace-cross Abstract: The 2-Forrelation problem provides an optimal separation between classical and quantum query complexity and is also the problem used for separating…
arXiv:2404.16450v3 Announce Type: replace-cross Abstract: In 1994, Shor introduced his famous quantum algorithm to factor integers and compute discrete logarithms in polynomial time. In 2023, Regev proposed a…
arXiv:2608.17109v3 Announce Type: replace-cross Abstract: Efficient decoding is essential for the practical realization of fault-tolerant quantum computers. We study the computational complexity of minimum-weight…
arXiv:2608.23828v1 Announce Type: new Abstract: We prove that exact Euclidean decision-CVP is $\mathsf{NP}$-complete on coefficient lattices of nonzero principal ideals in the power-of-two cyclotomic rings…
arXiv:2608.23847v1 Announce Type: cross Abstract: This paper proposes the Coronavirus Optimization Algorithm (COA), a SARS-CoV-2-inspired success-history adaptive evolutionary optimizer for box-constrained continuous…
arXiv:2608.18445v3 Announce Type: replace-cross Abstract: We present the first mechanised formalisation of Romanov's Triplet Logic (TLS) in the Rocq proof assistant. TLS is a combinatorial framework originally motivated…
arXiv:2608.23506v2 Announce Type: replace-cross Abstract: We prove that minimum Riesz $s$-energy subset selection in the Euclidean plane is NP-complete already for the fixed exponent $s=2$. To our knowledge, this is the…
arXiv:2608.22290v2 Announce Type: replace Abstract: We show that approximately counting the vertices of a bounded 0/1 polytope, presented as a system of rational linear inequalities, is, informally speaking, NP-hard. In…
arXiv:2608.24239v1 Announce Type: new Abstract: We prove three theorems on the flow monoids of finite graphs. First, we show that a non-empty finite graph G = (V, E) is connected if and only if its flow monoid contains…
arXiv:2608.24336v1 Announce Type: cross Abstract: Metric bases of graphs have been widely studied since their introduction in the 1970's by Slater and, independently, by Harary and Melter. In this paper, we concentrate…
arXiv:2509.24656v3 Announce Type: replace-cross Abstract: We revisit the tree-based formulation of the minimum-cost multi-commodity flow problem, due to Jones et al. (1993), who found that path-based decomposition…
arXiv:2608.23500v2 Announce Type: replace-cross Abstract: Let $\lambda(n)=(-1)^{\Omega(n)}$ be the Liouville function. We prove that there is an absolute constant $c>0$ such that, for every fixed $A>0$, $\displaystyle…
arXiv:2608.23652v1 Announce Type: cross Abstract: For integers $k,g \ge 3$ let $n_g(k)$ denote the minimum order of a graph with chromatic number $k$ and girth at least $g$. Exoo and Goedgebeur (DMTCS 2019) proved $26…
arXiv:2608.23876v1 Announce Type: cross Abstract: Centrality measures are defined for simple graphs -- directed, undirected, weighted or unweighted. Attributed graphs have to be reduced to simple graphs for computing…
arXiv:2608.23691v1 Announce Type: cross Abstract: We study autonomous mathematical discovery in the Station, an open-world multi-agent environment in which AI agents from different model families pursue a shared…
arXiv:2608.24865v1 Announce Type: cross Abstract: Lipschitz constants are a standard way to quantify the sensitivity of neural networks to small input perturbations, but computing them is difficult even for shallow ReLU…
Showing 1 day · 45 items available
