Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus
Curticapean, Radu and Marx, Dániel (2016) Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus. In: 27th Annual ACM-SIAM Symposium on Discrete Algorithms. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (3). Association for Computing Machinery, Red Hook NY, pp. 1650-1669. ISBN 9781510819672
![[img]](https://eprints.sztaki.hu/style/images/fileicons/text.png) |
Text
Curticapean_1650_3174165_z.pdf Restricted to Registered users only Download (250kB) |
| Item Type: | Book Section |
|---|---|
| Uncontrolled Keywords: | Trees (mathematics); Tree decomposition; Strong Exponential Time Hypothesis; PERFECT MATCHINGS; Optimal algorithm; Exponential time hypothesis; Edge dominating set; Counting problems; Bounded treewidth; Polynomial approximation; Graphic methods; Computational complexity; Algorithms |
| Subjects: | Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
| Divisions: | Informatics Laboratory |
| SWORD Depositor: | MTMT Injector |
| Depositing User: | MTMT Injector |
| Date Deposited: | 29 Jan 2017 20:36 |
| Last Modified: | 29 Jan 2017 20:36 |
| URI: | https://eprints.sztaki.hu/id/eprint/9044 |
 |
Update Item |
