scientific article; zbMATH DE number 2119676
From MaRDI portal
Publication:4828947
zbMath1093.68671MaRDI QIDQ4828947
Publication date: 29 November 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonnumerical algorithms (68W05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (5)
The complexity of constraint satisfaction games and QCSP ⋮ Probabilistic argumentation ⋮ On the exact complexity of evaluating quantified \(k\)-\textsc{cnf} ⋮ An exact algorithm for the Boolean connectivity problem for \(k\)-CNF ⋮ On the Exact Complexity of Evaluating Quantified k-CNF
This page was built for publication:
