arXiv (All)
open access
Fast FPRAS for the Permanent
We give an FPRAS for the permanent of an $n\times n$ $0/1$ matrix with running time $\widetilde{O}(n^{3.5}\varepsilon^{-2})$. Our algorithm extends to a strongly polynomial FPRAS for arbitrary nonnegative matrices, as in previous works. Jerrum, Sinclair, and Vigoda (2004) gave the first FPRAS for th
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
- Subexponential Approximation of the Permanent in Deterministic Polynomial Time#997388
- The O(N) S-matrix Monolith#231584
- Memory-Time Trade-offs for Floating-Point Compression in Industrial Hierarchical Matrix Solvers#291691
- Polynomial-time algorithms with huge exponent/constant#787526
- Strong convergence rates of stochastic theta Milstein methods for index-1 stochastic differential algebraic equations under non-globally Lipschitz conditions#1084527
Record · ID 1034514
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