P-time algorithms for typical \#EO problems
From MaRDI portal
P-time algorithms for typical \EO problems
Cites work
- A complete dichotomy rises from the capture of vanishing signatures (extended abstract)
- A Complexity Dichotomy for Partition Functions with Mixed Signs
- A decidable dichotomy theorem on directed graph homomorphisms with non-negative weights
- A dichotomy for real Boolean Holant problems
- A full dichotomy for \(\mathrm{Holant}^c\), inspired by quantum computation
- An effective dichotomy for the counting constraint satisfaction problem
- Beyond \#CSP: a dichotomy for counting weighted Eulerian orientations with ARS
- Classification of Bipartite Boolean Constraint Satisfaction through Delta-Matroid Intersection
- Complexity classification of the eight-vertex model
- Complexity classification of the six-vertex model
- Complexity Dichotomies for Counting Problems
- Complexity of counting CSP with complex weights
- Computational complexity of Holant problems
- Dichotomy for Holant* problems of Boolean domain
- Dichotomy for real Holant\(^{\mathrm c}\) problems
- Graph homomorphisms with complex values: a dichotomy theorem
- Holant problems and counting CSP
- Holographic Algorithms
- scientific article; zbMATH DE number 1545676 (Why is no real title available?)
- scientific article; zbMATH DE number 1380572 (Why is no real title available?)
- scientific article; zbMATH DE number 7788431 (Why is no real title available?)
- Nonnegative weighted \#CSP: an effective complexity dichotomy
- On counting homomorphisms to directed acyclic graphs
- On the complexity of \#CSP
- On the complexity of H-coloring
- On the evaluation at (3,3) of the Tutte polynomial of a graph
- Operations with structures
- Perfect matchings, rank of connection tensors and graph homomorphisms
- The complexity of Boolean Holant problems with nonnegative weights
- The complexity of complex weighted Boolean \#CSP
- The complexity of partition functions
- The complexity of the counting constraint satisfaction problem
- The complexity of weighted and unweighted \(\#\)CSP
- The Complexity of Weighted Boolean #CSP
- The complexity of weighted Boolean \#CSP modulo \(k\)
- The complexity of weighted Boolean \#CSP with mixed signs
- Towards a dichotomy theorem for the counting constraint satisfaction problem
- Valiant's holant theorem and matchgate tensors
This page was built for publication: P-time algorithms for typical \#EO problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363206)
