The Monotone Complexity of $k$-Clique on Random Graphs (Q5419039): 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.1137/110839059 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2159233562 / rank | |||
Normal rank | |||
Latest revision as of 19:09, 19 March 2024
scientific article; zbMATH DE number 6300925
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Monotone Complexity of $k$-Clique on Random Graphs |
scientific article; zbMATH DE number 6300925 |
Statements
The Monotone Complexity of $k$-Clique on Random Graphs (English)
0 references
4 June 2014
0 references
monotone circuit
0 references
clique
0 references
random graphs
0 references
average-case complexity
0 references
quasi-sunflowers
0 references
