A spectral technique for random satisfiable 3CNF formulas
From MaRDI portal
Publication:3514702
DOI10.1002/rsa.20213zbMath1140.68404MaRDI QIDQ3514702
Publication date: 21 July 2008
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20213
68Q25: Analysis of algorithms and problem complexity
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Cryptographic hardness of random local functions. Survey, Solving non-uniform planted and filtered random SAT formulas greedily, Time complexity analysis of evolutionary algorithms on random satisfiable \(k\)-CNF formulas
Cites Work