Computing sparse permanents faster (Q1044712): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2005.06.007
+Normal rank
@@ Property / OpenAlex ID @@
+W2160392814
@@ Property / OpenAlex ID: W2160392814 / rank @@
+Normal rank
@@ Property / cites work @@
+A permanent algorithm with \(\text{exp}[\Omega(n^{1/3}/2\text{ln}n)]\) expected speedup for \(0-1\) matrices
+Normal rank
@@ Property / cites work @@
+A polynomial-time approximation algorithm for the permanent of a matrix with  non-negative entries
+Normal rank
@@ Property / cites work @@
+Q3851094
@@ Property / cites work: Q3851094 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank