Pages that link to "Item:Q4962155"
From MaRDI portal
The following pages link to Exponential Time Complexity of the Permanent and the Tutte Polynomial (Q4962155):
Displaying 23 items.
- The relative exponential time complexity of approximate counting satisfying assignments (Q309794) (← links)
- Block interpolation: a framework for tight exponential-time counting complexity (Q1640999) (← links)
- Fine-grained dichotomies for the Tutte plane and Boolean \#CSP (Q1725642) (← links)
- Counting the number of perfect matchings, and generalized decision trees (Q2044128) (← links)
- Completeness, approximability and exponential time results for counting problems with easy decision version (Q2143122) (← links)
- Counting edge-injective homomorphisms and matchings on restricted graph classes (Q2321927) (← links)
- Computing the permanent modulo a prime power (Q2628281) (← links)
- (Q3067455) (← links)
- Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor (Q4705350) (← links)
- Counting problems in parameterized complexity (Q5009461) (← links)
- Counting Homomorphisms to $K_4$-Minor-Free Graphs, Modulo 2 (Q5013574) (← links)
- On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection (Q5041250) (← links)
- Counting Solutions to Polynomial Systems via Reductions (Q5240420) (← links)
- Below all subsets for some permutational counting problems (Q5369519) (← links)
- Approximation algorithms for replenishment problems with fixed turnover times (Q5918783) (← links)
- Lower bounds for the happy coloring problems (Q5918935) (← links)
- On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts (Q6157971) (← links)
- Parameterized Counting and Cayley Graph Expanders (Q6158357) (← links)
- Proper colorability of segment intersection graphs (Q6571282) (← links)
- Parameterized approximation algorithms and lower bounds for \(k\)-center clustering and variants (Q6586660) (← links)
- The fine-grained complexity of approximately counting proper connected colorings (extended abstract) (Q6606223) (← links)
- Enumerative and structural aspects of anagrams without fixed letters (Q6659946) (← links)
- AntiFactor is FPT parameterized by treewidth and list size (but counting is hard) (Q6670813) (← links)