A randomized algorithm approximates the number of perfect matchings in every finite simple undirected graph to relative error ε with failure probability at most δ in worst-case bit time polynomial in the input length, ε⁻¹, and log δ⁻¹; it returns zero with certainty when there is no perfect matching.
A randomized algorithm approximates the number of perfect matchings in every finite simple undirected graph to relative error ε with failure probability at most δ in worst-case bit time polynomial in the input length, ε⁻¹, and log δ⁻¹; it returns zero with certainty when there is no perfect matching.
A randomized algorithm approximates the number of perfect matchings in every finite simple undirected graph to relative error ε with failure probability at most δ in worst-case bit time polynomial in the input length, ε⁻¹, and log δ⁻¹; it returns zero with certainty when there is no perfect matching.
If correct, resolves the long-standing general-graph perfect-matching approximation problem.
Can perfect matchings be approximately counted in general graphs in randomized polynomial time?
Publication dates and editorial changes.
OpenAI reports an FPRAS for counting perfect matchings in general graphs
Allow optional Google Analytics to help improve AIProofWatch? Privacy details.
