Tree-width in algebraic complexity

DOI10.3233/FI-2010-235MaRDI QIDQ3561221zbMATH OpenOpenAlexFDO

Authors Klaus Meer

Publication date 25 May 2010

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2010-235

zbMATH Keywords

survey papertree-widthdescriptive complexityunit-cost model of computationvaliant model of computation

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78) Descriptive complexity and finite models (68Q19)

Recommendations

• scientific article; zbMATH DE number 1859215
• An extended tree-width notion for directed graphs related to the computation of permanents
• On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width
• On the expressive power of CNF formulas of bounded tree- and clique-width
• On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract)

Cited in

(12)

• An algorithmic metatheorem for directed treewidth
• scientific article; zbMATH DE number 1859215 (Why is no real title available?)
• Tree-Width for First Order Formulae
• On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth
• The treewidth of proofs
• On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width
• Treewidth and the Computational Complexity of MAP Approximations
• On topological lower bounds for algebraic computation trees
• Tree-width and the Sherali-Adams operator
• Boxicity and treewidth
• scientific article; zbMATH DE number 1504634 (Why is no real title available?)
• scientific article; zbMATH DE number 1944139 (Why is no real title available?)

This page was built for publication: Tree-width in algebraic complexity

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