Holographic Algorithm with Matchgates Is Universal for Planar $\#$CSP Over Boolean Domain.
Jin-Yi CaiZhiguo FuPublished in: CoRR (2016)
Keyphrases
- experimental evaluation
- preprocessing
- learning algorithm
- computational complexity
- optimal solution
- recognition algorithm
- times faster
- significant improvement
- cost function
- np hard
- dynamic programming
- objective function
- matching algorithm
- optimization algorithm
- worst case
- computational cost
- linear programming
- particle swarm optimization
- neural network
- detection algorithm
- search space
- lower bound
- convex hull
- reinforcement learning
- space complexity
- multi valued