Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Tight conditional lower bounds for counting perfect matchings on graphs of ..."

Radu Curticapean, Dániel Marx (2016)

> Home

Details and statistics

DOI: 10.1137/1.9781611974331.CH113

access: open

type: Conference or Workshop Paper

metadata version: 2021-02-02

- view
  - electronic edition via DOI (open access)
  - electronic edition @ acm.org
  authority control:
- export record
  dblp key:
  - conf/soda/CurticapeanM16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/CurticapeanM16
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

a service of

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.