Approximate Counting of <i>k</i> -Paths: Simpler, Deterministic, and in Polynomial Space (Q5032035)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximate Counting of k -Paths: Simpler, Deterministic, and in Polynomial Space |
scientific article; zbMATH DE number 7475106
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximate Counting of <i>k</i> -Paths: Simpler, Deterministic, and in Polynomial Space |
scientific article; zbMATH DE number 7475106 |
Statements
Approximate Counting of <i>k</i> -Paths: Simpler, Deterministic, and in Polynomial Space (English)
0 references
16 February 2022
0 references
parameterized complexity
0 references
\(k\)-path
0 references
parameterized counting problems
0 references
0.9729316830635072
0 references
0.7794508337974548
0 references
0.7730352282524109
0 references
