Pages that link to "Item:Q5383984"
From MaRDI portal
The following pages link to A Simple FPTAS for Counting Edge Covers (Q5383984):
Displaying 10 items.
- An FPTAS for the volume computation of 0-1 knapsack polytopes based on approximate convolution (Q727987) (← links)
- An FPTAS for the volume of some \(\mathcal{V} \)-polytopes -- it is hard to compute the volume of the intersection of two cross-polytopes (Q784479) (← links)
- The complexity of Bayesian networks specified by propositional and relational languages (Q1711881) (← links)
- Counting hypergraph matchings up to uniqueness threshold (Q1740650) (← links)
- Zero-freeness and approximation of real Boolean Holant problems (Q2143138) (← links)
- Some applications of Wagner's weighted subgraph counting polynomial (Q2236817) (← links)
- Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials (Q4602373) (← links)
- Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model (Q4634031) (← links)
- On the Complexity of Holant Problems (Q4993599) (← links)
- Absence of zeros implies strong spatial mixing (Q6045833) (← links)
