The Complexity of Graph Pebbling (Q5757392): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q711180 |
Changed an Item |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: Bryan K. Clark / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2033611584 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: math/0503698 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 03:05, 20 April 2024
scientific article; zbMATH DE number 5188078
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Complexity of Graph Pebbling |
scientific article; zbMATH DE number 5188078 |
Statements
The Complexity of Graph Pebbling (English)
0 references
6 September 2007
0 references
graph pebbling
0 references
complexity
0 references
\({\Pi_2^{\mathrm{p}}}\)-completeness
0 references
