On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices
type: Item
instance of: scholarly article
title: On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices
zbMATH Open document ID: 1141.68418
DOI: 10.1007/978-3-540-77120-3_13
author: Uffe Flarup
author: Laurent Lyaudet
author: Pascal Koiran
published in: Algorithms and Computation
publication date: 2008-05-27T00:00:00Z
full work available at URL: formulas.pdf
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 5279444
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W2152376083
cites work: Two Algorithmic Results for the Traveling Salesman Problem
cites work: Parallel algorithms with optimal speedup for bounded treewidth
cites work: Completeness and reduction in algebraic complexity theory
cites work: Q4273871
cites work: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
cites work: Q5605168
cites work: The combinatorial approach yields an NC algorithm for computing Pfaffians
cites work: Q4789198
cites work: Characterizing Valiant’s Algebraic Complexity Classes
cites work: The complexity of computing the permanent
cites work: Q3929052
Recommended article: On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract)
Recommended article: On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth
Recommended article: Planarity, determinants, permanents, and (unique) matchings
Recommended article: Planarity, Determinants, Permanents, and (Unique) Matchings
Recommended article: On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width
description: scientific article; zbMATH DE number 5279444