Boning Meng
1 indexed paper
Recent (6 mo)
1With code
0Influential cites
0Benchmarked
0Publications per year
126
Top categories
Algorithms×1Combinatorics×1
Frequent co-authors
Research Timeline
2026
A simplified proof of the FPRAS for counting perfect matchings
This paper simplifies the proof of OpenAI's FPRAS for counting perfect matchings in general graphs.
Highlighted terms show continued research focus across papers