On smoothed analysis in dense graphs and formulas (Q3419587): Difference between revisions

@@ Property / author @@
-Benjamin Sudakov
@@ Property / author: Benjamin Sudakov / rank @@
-Normal rank
@@ Property / author @@
-Prasad Tetali
@@ Property / author: Prasad Tetali / rank @@
-Normal rank
@@ Property / author @@
+Benjamin Sudakov
@@ Property / author: Benjamin Sudakov / rank @@
+Normal rank
@@ Property / author @@
+Prasad Tetali
@@ Property / author: Prasad Tetali / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1002/rsa.20097
@@ Property / full work available at URL: https://doi.org/10.1002/rsa.20097 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W4247942259
@@ Property / OpenAlex ID: W4247942259 / rank @@
+Normal rank
@@ Property / cites work @@
+The threshold for random k-SAT is 2             <sup>k</sup>             (ln 2 - O(k))
+Normal rank
@@ Property / cites work @@
+Q4228436
@@ Property / cites work: Q4228436 / rank @@
+Normal rank
@@ Property / cites work @@
+Smoothed analysis of algorithms
@@ Property / cites work: Smoothed analysis of algorithms / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3419587