Stop the war!
Остановите войну!
for scientists:
default search action
"Tight conditional lower bounds for counting perfect matchings on graphs of ..."
Radu Curticapean, Dániel Marx (2016)
- Radu Curticapean, Dániel Marx:
Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus. SODA 2016: 1650-1669
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.