arXiv (All)
open access
Local Search with Correlated Randomness
How much does an algorithm's running-time distribution under independent randomness reveal about its behavior when independence is no longer guaranteed? We study sources satisfying $ν[w]\le DP[w]^s$ for every finite prefix $w$, where $P$ is an independent reference law, $0<s\le1$, and $D\ge1$. The c
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Stable and Online Algorithms for Random Matrix Discrepancy#1156862
- Quantifying Randomness in Stochastic Bit Sequences / Christoph Lange, Andreas Ahrens, Yadu Krishnan Krishnakumar, Denise Engert, Ming Yin ; Herausgeber: Nikos Fotiou#1106459
- The strong converse exponent of composable randomness extraction against quantum side information#1116194
- Visitation measures for non-linear iterations with random perturbations#1142154
- Equi-dependence implying independence#986321
Record · ID 1141608
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive