scientific article; zbMATH DE number 5604103

MaRDI QIDQ3395987zbMATH OpenFDO

Authors Kazuo Iwama

Publication date 15 September 2009

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20)

Cited in

(12)

• On solving sparse algebraic equations over finite fields
• On two techniques of combining branching and treewidth
• Exact algorithms for edge domination
• Improved agreeing-gluing algorithm
• Treewidth computation and extremal combinatorics
• A combinatorial problem related to sparse systems of equations
• Sparse Boolean equations and circuit lattices
• An exact algorithm for the minimum dominating clique problem
• Exact Algorithms for Edge Domination
• Exact algorithms for dominating set
• Determining a singleton attractor of an AND/OR Boolean network in \(O(n^{1.587})\) time
• Solving connected dominating set faster than \(2^n\)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3395987)