Pages that link to "Item:Q1959434"
From MaRDI portal
The following pages link to A deterministic approximation algorithm for computing the permanent of a 0, 1 matrix (Q1959434):
Displaying 11 items.
- Computing the permanent of (some) complex matrices (Q285430) (← links)
- Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs (Q401479) (← links)
- Correlation decay and deterministic FPTAS for counting colorings of a graph (Q414468) (← links)
- How fast can one compute the permanent of circulant matrices? (Q1124882) (← links)
- A lower bound for monotone arithmetic circuits computing \(0-1\) permanent (Q1276316) (← links)
- On the hardness of approximating the permanent of structured matrices (Q1430572) (← links)
- A mildly exponential approximation algorithm for the permanent (Q1923855) (← links)
- Matchings in Benjamini-Schramm convergent graph sequences (Q2790620) (← links)
- Approximating permanents and hafnians (Q4645007) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465859) (← links)
- A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents (Q5932755) (← links)