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)


![Spin textures-specifically Rashba, persistent spin helix, and Dresselhaus states-exhibit a striking enhancement of all quantum metric components [latex]g_{\mu\nu}[/latex] when Rashba and Dresselhaus strengths equalize, signaling a unique signature of the persistent spin helix state and demonstrating how geometric properties emerge from spin-orbit interactions.](https://arxiv.org/html/2603.08009v1/x1.png)

