The Parameterized Complexity of Counting Problems (Q4651498): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1137/s0097539703427203 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2137874581 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 08:33, 30 July 2024
scientific article; zbMATH DE number 2135799
Language | Label | Description | Also known as |
---|---|---|---|
English | The Parameterized Complexity of Counting Problems |
scientific article; zbMATH DE number 2135799 |
Statements
The Parameterized Complexity of Counting Problems (English)
0 references
21 February 2005
0 references
counting complexity
0 references
parameterized complexity
0 references
paths and cycles
0 references
descriptive complexity
0 references