Tree-width in Algebraic Complexity
From MaRDI portal
Publication:3561221
DOI10.3233/FI-2010-235zbMath1210.03028OpenAlexW2155592214MaRDI QIDQ3561221
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
survey papertree-widthdescriptive complexityunit-cost model of computationvaliant model of computation
Descriptive complexity and finite models (68Q19) Computation over the reals, computable analysis (03D78)
This page was built for publication: Tree-width in Algebraic Complexity