scientific article
From MaRDI portal
Publication:3395987
zbMath1169.68443MaRDI QIDQ3395987
Publication date: 15 September 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (12)
Treewidth computation and extremal combinatorics ⋮ A combinatorial problem related to sparse systems of equations ⋮ Exact Algorithms for Edge Domination ⋮ Exact algorithms for dominating set ⋮ Exact algorithms for edge domination ⋮ Sparse Boolean equations and circuit lattices ⋮ An exact algorithm for the minimum dominating clique problem ⋮ Solving connected dominating set faster than \(2^n\) ⋮ Improved agreeing-gluing algorithm ⋮ On solving sparse algebraic equations over finite fields ⋮ On two techniques of combining branching and treewidth ⋮ Determining a singleton attractor of an AND/OR Boolean network in \(O(n^{1.587})\) time
This page was built for publication: