Pages that link to "Item:Q5465859"
From MaRDI portal
The following pages link to FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465859):
Displaying 13 items.
- Random path method with pivoting for computing permanents of matrices (Q870138) (← links)
- Computing sparse permanents faster (Q1044712) (← links)
- On the hardness of approximating the permanent of structured matrices (Q1430572) (← links)
- Matrix permanent inequalities for approximating joint assignment matrices in tracking systems (Q1771051) (← links)
- An analysis of Monte Carlo algorithm for estimating the permanent (Q1842570) (← links)
- A mildly exponential approximation algorithm for the permanent (Q1923855) (← links)
- A deterministic approximation algorithm for computing the permanent of a 0, 1 matrix (Q1959434) (← links)
- Scaling matrices and counting the perfect matchings in graphs (Q2064289) (← links)
- Completeness, approximability and exponential time results for counting problems with easy decision version (Q2143122) (← links)
- Solution counting algorithms for constraint-centered search heuristics (Q2272161) (← links)
- Approximating the Permanent (Q3211352) (← links)
- A Monte-Carlo Algorithm for Estimating the Permanent (Q4032938) (← links)
- Approximating the permanent: A simple approach (Q4286300) (← links)