A simplified proof of the FPRAS for counting perfect matchings | ArxivCSExplorer