scientific article; zbMATH DE number 7051213
From MaRDI portal
zbMath1421.68059MaRDI QIDQ4633854
Michael Krivelevich, Amin Coja-Oghlan, Dan Vilenchik, Uriel Feige, Alan M. Frieze
Publication date: 6 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=1496820
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items
Smoothed Analysis of Local Search Algorithms, Performances of pure random walk algorithms on constraint satisfaction problems with growing domains, A Computing Procedure for Quantification Theory, Smoothed Analysis on Connected Graphs
