On smoothed analysis in dense graphs and formulas (Q3419587): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/rsa.20097 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4247942259 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The threshold for random k-SAT is 2 <sup>k</sup> (ln 2 - O(k)) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4228436 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Smoothed analysis of algorithms / rank | |||
Normal rank | |||
Latest revision as of 12:45, 25 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On smoothed analysis in dense graphs and formulas |
scientific article |
Statements
On smoothed analysis in dense graphs and formulas (English)
0 references
7 February 2007
0 references
random graphs
0 references
