Holographic algorithms on bases of rank 2
A theorem to determine if recognizers on domain size k>2 k > 2 are simultaneously realized on a basis of rank 2. A theorem to reduce SRP on domain size k>2 k > 2 to SRP on domain size 2 for holographic algorithms with matchgates. A collapse theorem for holographic algorithms with matchgates on domain size k>2 k > 2 .
holographic algorithms srp computational complexity matchgate computation