arxiv.org/abs/2512.02001v1
Previous work of the second author and Wolf showed that given a set $A\subseteq \mathbb{F}_p^n$ of bounded $\textrm{VC}_2$-dimension, there is a high rank quadratic factor $\mathcal{B}$ of bounded complexity such that $A$ is approximately equal to a...
arxiv.org/abs/1201.1223v1
We describe the Turing Machine, list some of its many influences on the theory of computation and complexity of computations, and illustrate its importance....
arxiv.org/abs/1108.3383v2
We introduce an idea called anti-gadgets in complexity reductions. These combinatorial gadgets have the effect of erasing the presence of some other graph fragment, as if we had managed to include a negative copy of a graph gadget. We use this idea t...
arxiv.org/abs/2211.03396v3
We introduce and study Certificate Game complexity, a measure of complexity based on the probability of winning a game where two players are given inputs with different function values and are asked to output some index $i$ such that $x_i\neq y_i$, i...
arxiv.org/abs/2509.17367v1
We present a comparative analysis of text complexity across domains using scale-free metrics. We quantify linguistic complexity via Heaps' exponent $β$ (vocabulary growth), Taylor's exponent $α$ (word-frequency fluctuation scaling), compression rat...
arxiv.org/abs/1310.2905v2
These are the written discussions of the paper "Bayesian measures of model complexity and fit" by D. Spiegelhalter et al. (2002), following the discussions given at the Annual Meeting of the Royal Statistical Society in Newcastle-upon-Tyne on Septemb...
arxiv.org/abs/1808.00998v2
The complexity of mathematical models describing respiratory mechanics has grown in recent years to integrate with cardiovascular models and incorporate nonlinear dynamics. However, additional model complexity has rarely been studied in the context o...
arxiv.org/abs/nlin/0701048v1
The letter by Mark Perakh entitled "DEFINING COMPLEXITY: A Commentary to a paper by Charles H. Bennett" is here archived with the permission of the author. This letter was downloaded from the site "On Talk Reason, http://www.talkreason.org/articles...
arxiv.org/abs/1203.2377v1
Stretching is a new sparse matrix method that makes matrices sparser by making them larger. Stretching has implications for computational complexity theory and applications in scientific and parallel computing. It changes matrix sparsity patterns to...
arxiv.org/abs/2306.13057v1
We study the complexity of learning mixtures of separated Gaussians with common unknown bounded covariance matrix. Specifically, we focus on learning Gaussian mixture models (GMMs) on $\mathbb{R}^d$ of the form $P= \sum_{i=1}^k w_i \mathcal{N}(\bolds...
arxiv.org/abs/2403.04744v1
We study the complexity of Non-Gaussian Component Analysis (NGCA) in the Statistical Query (SQ) model. Prior work developed a general methodology to prove SQ lower bounds for this task that have been applicable to a wide range of contexts. In particu...
arxiv.org/abs/2509.10138v2
We consider conjunctive queries with arithmetic comparisons (CQAC) and investigate the computational complexity of the problem: Given two CQAC queries, $Q$ and $Q'$, is $Q'$ contained in $Q$? We know that, for CQAC queries, the problem of testing con...
arxiv.org/abs/2305.08350v1
Recently, there has been remarkable progress in reinforcement learning (RL) with general function approximation. However, all these works only provide regret or sample complexity guarantees. It is still an open question if one can achieve stronger pe...
arxiv.org/abs/2206.07690v2
Deep learning models have achieved remarkable success in different areas of machine learning over the past decade; however, the size and complexity of these models make them difficult to understand. In an effort to make them more interpretable, sever...
arxiv.org/abs/2104.06970v3
We provide new insights on eluder dimension, a complexity measure that has been extensively used to bound the regret of algorithms for online bandits and reinforcement learning with function approximation. First, we study the relationship between the...
en.wikipedia.org/wiki/Principles_of_Compiler_Design
"green dragon book" and its cover depicts a knight and a dragon in battle; the dragon is green, and labeled "Complexity of Compiler Design", while the knight
www.bing.com/ck/a?!&&p=05fae04f5c3946bda16c01b8a3aa6a92df9ff3e20792c777d9f2b2e7059a4d97JmltdHM9MTc3Mjg0MTYwMA&ptn=3&ver=2&hsh=4&fclid=3c9d84ae-7aed-62bd-3914-93b87b2363a1&u=a1aHR0cHM6Ly9lbi53aWt0aW9uYXJ5Lm9yZy93aWtpL2ludHJpY2F0ZQ&ntb=1
Jan 20, 2026 · Adjective intricate (comparative more intricate, superlative most intricate) Having a great deal of fine detail or complexity. Synonyms: fancy, convoluted The architecture of this clock is very …
www.bing.com/ck/a?!&&p=be165eb3fcef2dfa63c54763683bf8fcb4ef6fa316fba7ed82c35c20d964879bJmltdHM9MTc3Mjg0MTYwMA&ptn=3&ver=2&hsh=4&fclid=34e8fed9-5052-6c07-2cba-e9cf51386d0c&u=a1aHR0cHM6Ly9lbi53aWt0aW9uYXJ5Lm9yZy93aWtpL2ludHJpY2F0ZQ&ntb=1
Jan 20, 2026 · Adjective intricate (comparative more intricate, superlative most intricate) Having a great deal of fine detail or complexity. Synonyms: fancy, convoluted The architecture of this clock is very …
arxiv.org/abs/2004.04650v2
Modern model-free reinforcement learning methods have recently demonstrated impressive results on a number of problems. However, complex domains like dexterous manipulation remain a challenge due to the high sample complexity. To address this, curren...
www.bing.com/ck/a?!&&p=25a3f896510592c2a4bc65263d9163cffac6c528a7ed58814e749c32b65e630fJmltdHM9MTc3Mjg0MTYwMA&ptn=3&ver=2&hsh=4&fclid=0553b7ba-7253-6d3b-102e-a0ac73f46ca5&u=a1aHR0cHM6Ly93d3cud2Vmb3J1bS5vcmcvc3Rvcmllcy8yMDI2LzAxL3RyYWRlLWlzLWNoYW5naW5nLWFuZC1kYXZvcy0yMDI2LW1hZGUtaXQtY2xlYXItaGVyZS1hcmUtMTAtaW5zaWdodHMv&ntb=1
Jan 23, 2026 · Trade was a major topic of discussion at the Annual Meeting 2026 in Davos. Expert participants examined everything from how geopolitical complexity is accelerating trade deals to the …