arXiv (All)
open access
A simplified proof of the FPRAS for counting perfect matchings
We give a simplified, self-contained proof of OpenAI's FPRAS for counting perfect matchings in general graphs. As in the original proof, we use a restricted Poincaré inequality for two matchings to sample weighted perfect matchings and estimate their total weight. We simplify the proof of this inequ
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
- A Forced-Structure Reduction and Verifiable Bounds for Conway's 99-Graph#1036437
- Strict monotonicity of weighted inhomogeneous percolation thresholds under covering maps#1386395
- Acyclic Dichromatic Number of Tournaments: these are the Champions#1327463
- Structural Reductions for Monochromatic Matchings and Ramsey Tilings#652365
- Structural Reductions for Monochromatic Matchings and Ramsey Tilings#650912
Record · ID 1402053
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