The resolution complexity of independent sets and vertex covers in random graphs (Q2474203): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user 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.1007/s00037-007-0230-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2079758416 / rank | |||
Normal rank | |||
Latest revision as of 22:24, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The resolution complexity of independent sets and vertex covers in random graphs |
scientific article |
Statements
The resolution complexity of independent sets and vertex covers in random graphs (English)
0 references
5 March 2008
0 references
resolution proof
0 references
proof complexity
0 references
hardness of approximation
0 references
independent set
0 references
vertex cover
0 references
