arXiv (OAI Expanded)
open access
Structural Corrections to the Bethe Approximation of the Permanent
We study deterministic approximation algorithms for the permanent of a nonnegative matrix through the Bethe permanent, an approximation computable in polynomial time. The tight analysis of Anari and Rezaei gives a universal comparison between the permanent and the Bethe permanent within a factor $(\
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
- Structural Corrections to the Bethe Approximation of the Permanent#819088
- Error Estimates for the Arnoldi Approximation of a Matrix Square Root#1142545
- A simpler proof of the Matrix Spencer Theorem#1110487
- A deterministic $(1+\varepsilon)^n$ approximation for the permanent of a nonnegative matrix#998613
- Minor-Order Exponent Profiles of Oscillatory Matrices#973417
Record · ID 809096
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