DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Holographic algorithm
Holographic algorithm
Complexity Dichotomies of Counting Problems
National and Kapodistrian University of Athens Complexity Dichotomies
Some Observations on Holographic Algorithms
Mapping the Complexity of Counting Problems
Holographic Algorithms
Polynomial-Time Solvable #CSP Problems Via Algebraic Models and Pfaffian Circuits S
Counting Algorithms and Complexity. a Brief Overview of the Field
On the Power of Holographic Algorithms with Matchgates
Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP
Fast Counting with Tensor Networks Abstract Contents 1 Introduction
Some Results on Matchgates and Holographic Algorithms
Holographic Algorithms: from Art to Science
Normal Factor Graphs
Some Results on Matchgates and Holographic Algorithms
Computational Complexity of Counting Problems on 3-Regular Planar Graphs
A Planar Holant Dichotomy for Symmetric Constraints∗
Base Collapse of Holographic Algorithms Arxiv:1511.01230V1 [Cs
A Complexity Trichotomy for K-Regular Asymmetric Spin Systems Using Number Theory
Top View