scientific article; zbMATH DE number 6469140
From MaRDI portal
Publication:5501251
zbMath1317.68060MaRDI QIDQ5501251
No author found.
Publication date: 3 August 2015
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
Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas ⋮ Dismantlability, connectedness, and mixing in relational structures ⋮ Limitations of restricted branching in clause learning ⋮ Dismantlability, Connectedness, and Mixing in Relational Structures ⋮ Walksat Stalls Well Below Satisfiability
