arXiv (All)
open access
An $O\big((5/3)^n\mathrm{poly}(n)\big)$ One-Sided Monte Carlo Algorithm for Equal Subset Sum
We give a randomised algorithm for Equal Subset Sum that, on $n$ arbitrary integers of at most $m\le2^n$ bits, runs in time $O\big((5/3)^n\mathrm{poly}(n)+n^2m\big)$, never outputs a non-solution, and outputs a solution with probability $1-2^{-Ω(n)}$ whenever one exists.
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
- Polynomial-time additive-error estimation of output probabilities for shallow quantum circuits#1157494
- DIME: Dynamics Inferred from Monte Carlo Ensembles via Continuous-Time Markov Chains#661907
- Exact and Efficient Sampling from Dynamic Discrete Distributions with Finite-Precision Weights#173313
- A sharp version of Talagrand's selector process conjecture, with applications to rounding fractional covers and Bernoulli Sudakov minoration#974171
- Exploring Randomness#762117
Record · ID 971845
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