scientific article; zbMATH DE number 7375939
From MaRDI portal
Publication:5002678
DOI10.4230/LIPIcs.ICALP.2018.12zbMath1499.68139arXiv1704.05798MaRDI QIDQ5002678
Publication date: 28 July 2021
Full work available at URL: https://arxiv.org/abs/1704.05798
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Enumeration in graph theory (05C30) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)
Related Items (12)
Perfect matchings, rank of connection tensors and graph homomorphisms ⋮ Zero-freeness and approximation of real Boolean Holant problems ⋮ Counting Small Induced Subgraphs Satisfying Monotone Properties ⋮ Zeros and approximations of holant polynomials on the complex plane ⋮ A Full Dichotomy for $\hol^{c}$, Inspired by Quantum Computation ⋮ Dichotomy for Holant\(^\ast\) problems on the Boolean domain ⋮ Parameterized counting of partially injective homomorphisms ⋮ Dichotomy result on 3-regular bipartite non-negative functions ⋮ Bipartite 3-regular counting problems with mixed signs ⋮ Dichotomy result on 3-regular bipartite non-negative functions ⋮ FKT is not universal -- a planar holant dichotomy for symmetric constraints ⋮ The complexity of counting \(\mathrm{CSP}^d\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A dichotomy for real weighted Holant problems
- The complexity of complex weighted Boolean \#CSP
- Simple criteria for the SLOCC classification
- From Holant to \#CSP and back: dichotomy for Holant\(^{c}\) problems
- Valiant's holant theorem and matchgate tensors
- Completing the proof of ``Generic quantum nonlocality
- A Complete Dichotomy Rises from the Capture of Vanishing Signatures
- Holographic Algorithms
- Holographic algorithm with matchgates is universal for planar #CSP over boolean domain
- A New Holant Dichotomy Inspired by Quantum Computation
- Graph Homomorphisms with Complex Values: A Dichotomy Theorem
This page was built for publication:
