Pages that link to "Item:Q5387751"
From MaRDI portal
The following pages link to On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices (Q5387751):
Displaying 13 items.
- Log-space algorithms for paths and matchings in \(k\)-trees (Q385514) (← links)
- On the expressive power of CNF formulas of bounded tree- and clique-width (Q617890) (← links)
- An efficient tree decomposition method for permanents and mixed discriminants (Q905704) (← links)
- On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth (Q987381) (← links)
- Efficient computation of permanents, with applications to boson sampling and random matrices (Q2133747) (← links)
- An extended tree-width notion for directed graphs related to the computation of permanents (Q2254501) (← links)
- On hard instances of non-commutative permanent (Q2306589) (← links)
- On Hard Instances of Non-Commutative Permanent (Q2817859) (← links)
- An Extended Tree-Width Notion for Directed Graphs Related to the Computation of Permanents (Q3007631) (← links)
- Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems (Q3012844) (← links)
- On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract) (Q3503637) (← links)
- (Q5075762) (← links)
- On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width (Q5302060) (← links)
