Computing sparse permanents faster (Q1044712): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A permanent algorithm with \(\text{exp}[\Omega(n^{1/3}/2\text{ln}n)]\) expected speedup for \(0-1\) matrices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3851094 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of computing the permanent / rank | |||
Normal rank | |||
Latest revision as of 08:17, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing sparse permanents faster |
scientific article |
Statements
Computing sparse permanents faster (English)
0 references
18 December 2009
0 references
algorithms
0 references
combinatorial problems
0 references
computational complexity
0 references
0 references
0 references
