Quantified Boolean Formulas: Taming Complexity with Limited Existential Variables
New research establishes a definitive lower bound for solving a fundamental class of logical problems, even with simplified constraints, and offers algorithmic improvements for a common subproblem.

![A concentration-adjusted slippage analysis across 184 tokens reveals a pronounced liquidity risk within the most extreme 5% of observations, demarcated by a [latex]\mathrm{SaR}^{\mathrm{adj}}(0.95)=3.47\%[/latex] threshold, suggesting heightened vulnerability in those specific assets.](https://arxiv.org/html/2603.09164v1/figure1_slippage_distribution.png)

