A Collapse Theorem for Holographic Algorithms with Matchgates on Domain Size at Most 4
Jin-Yi CaiZhiguo FuPublished in: CoRR (2013)
Keyphrases
- computationally efficient
- theoretical analysis
- orders of magnitude
- computational complexity
- computational cost
- computational efficiency
- learning algorithm
- computer vision
- information systems
- data structure
- domain specific
- space complexity
- graph theory
- memory requirements
- recently developed
- times faster
- database
- significant improvement
- expert systems
- data mining