Dichotomy for real Holant^ c problems
From MaRDI portal
Publication:4608007
Recommendations
Cited in
(22)- Clifford gates in the Holant framework
- Dichotomy for Holant\(^\ast\) problems on the Boolean domain
- Parameterized counting of partially injective homomorphisms
- FKT is not universal -- a planar holant dichotomy for symmetric constraints
- The complexity of counting \(\mathrm{CSP}^d\)
- Zero-freeness and approximation of real Boolean Holant problems
- Zeros and approximations of holant polynomials on the complex plane
- Beyond \#CSP: a dichotomy for counting weighted Eulerian orientations with ARS
- A dichotomy for real weighted Holant problems
- A complete dichotomy rises from the capture of vanishing signatures
- The complexity of Boolean Holant problems with nonnegative weights
- A complete dichotomy for complex-valued \(\textsc{Holant}^c\)
- Counting Small Induced Subgraphs Satisfying Monotone Properties
- A full dichotomy for \(\mathrm{Holant}^c\), inspired by quantum computation
- A New Holant Dichotomy Inspired by Quantum Computation
- Dichotomy for Holant* problems of Boolean domain
- A complete dichotomy rises from the capture of vanishing signatures (extended abstract)
- Complexity classification of the eight-vertex model
- A complexity trichotomy for k-regular asymmetric spin systems with complex edge functions
- From holant to quantum entanglement and back
- Complete flow-preserving rewrite rules for MBQC patterns with Pauli measurements
- On the complexity of \#CSP\(^d\)
This page was built for publication: Dichotomy for real Holant\(^{\mathrm c}\) problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608007)
