Weighted tiling systems for graphs: evaluation complexity
From MaRDI portal
Cites work
- A Kleene theorem for weighted tree automata
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Adding pebbles to weighted automata: easy specification \& efficient evaluation
- Handbook of weighted automata
- scientific article; zbMATH DE number 176754 (Why is no real title available?)
- MSO decidability of multi-pushdown systems via split-width
- The complexity of computing the permanent
- The complexity of optimization problems
- The complexity of valued CSPs
- The complexity of weighted and unweighted \(\#\)CSP
- The Complexity of Weighted Boolean #CSP
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- The Kleene-Schützenberger theorem for formal power series in partially commuting variables.
- The tree width of auxiliary storage
- Towards a dichotomy theorem for the counting constraint satisfaction problem
- Tractability in constraint satisfaction problems: a survey
- Verifying communicating multi-pushdown systems via split-width
- Weighted automata and logics on graphs
- Weighted Distributed Systems and Their Logics
- Weighted logics for nested words and algebraic formal power series
- Weighted Logics for Traces
- Weighted picture automata and weighted logics
- Weighted tree automata and weighted logics
This page was built for publication: Weighted tiling systems for graphs: evaluation complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6839868)
