scientific article; zbMATH DE number 2079359
From MaRDI portal
Publication:4471318
zbMath1094.68574MaRDI QIDQ4471318
Publication date: 28 July 2004
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)
Related Items (8)
On the Complexity of Random Satisfiability Problems with Planted Solutions ⋮ Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability ⋮ Spectral techniques applied to sparse random graphs ⋮ More on average case vs approximation complexity ⋮ On the security of Goldreich's one-way function ⋮ A Spectral Method for MAX2SAT in the Planted Solution Model ⋮ Optimal testing for planted satisfiability problems ⋮ A Theoretical Analysis of Search in GSAT
This page was built for publication:
