Abstract
In holographic algorithms, symmetric signatures have been particularly useful. We give a complete characterization of these symmetric signatures over all bases of size 1. These improve previous results [4] where only symmetric signatures over the Hadamard basis (special basis of size 1) were obtained. In particular, we give a complete list of Boolean symmetric signatures over bases of size 1.
It is an open problem whether signatures over bases of higher dimensions are strictly more powerful. The recent result by Valiant [18] seems to suggest that bases of size 2 might be indeed more powerful than bases of size 1. This result is with regard to a restrictive counting version of #SAT called #Pl-Rtw-Mon-3CNF. It is known that the problem is #P-hard, and its mod 2 version is ⊕P-hard. Yet its mod 7 version is solvable in polynomial time by holographic algorithms. This was accomplished by a suitable symmetric signature over a basis of size 2 [18]. We show that the same unexpected holographic algorithm can be realized over a basis of size 1. Furthermore we prove that 7 is the only modulus for which such an “accidental algorithm” exists.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bubley, R., Dyer, M.: Graph orientations with no sink and an approximation for a hard case of #SAT. In: ACM SODA, pp. 248–257. ACM Press, New York (1997)
Cai, J.-Y., Choudhary, V.: Valiant’s Holant Theorem and Matchgate Tensors. In: Cai, J.-Y., Cooper, S.B., Li, A. (eds.) TAMC 2006. LNCS, vol. 3959, pp. 248–261. Springer, Heidelberg (Also available as ECCC TR05-118) (2006)
Cai, J.-Y., Choudhary, V.: On the Theory of Matchgate Computations. Submitted. Also available as ECCC TR06-018
Cai, J.-Y., Choudhary, V.: Some Results on Matchgates and Holographic Algorithms. In: Bugliesi, M., et al. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 703–714. Springer, Heidelberg (2006)
Cai, J.-Y., Lu, P.: On Symmetric Signatures in Holographic Algorithms. Available at Electronic Colloquium on Computational Complexity Report TR06-135
Hunt, H.B., et al.: The complexity of planar counting problems. SIAM J. Comput. 27(4), 1142–1167 (1998)
Hunt III., H.B., Stearns, R.E.: The complexity of very simple Boolean formulas with applications. SIAM J. Comput. 19(1), 44–70 (1990)
Kasteleyn, P.W.: The statistics of dimers on a lattice. Physica 27, 1209–1225 (1961)
Kasteleyn, P.W.: Graph Theory and Crystal Physics. In: Harary, F. (ed.) Graph Theory and Theoretical Physics, pp. 43–110. Academic Press, London (1967)
Lichtenstein, D.: Planar formulae and their uses. SIAM J. on Computing 11, 329–343 (1982)
Murota, K.: Matrices and Matroids for Systems Analysis. Springer, Berlin (2000)
Temperley, H.N.V., Fisher, M.E.: Dimer problem in statistical mechanics – an exact result. Philosophical Magazine 6, 1061–1063 (1961)
Valiant, L.G.: Quantum circuits that can be simulated classically in polynomial time. SIAM Journal on Computing 31(4), 1229–1254 (2002)
Valiant, L.G.: Expressiveness of Matchgates. Theoretical Computer Science 281(1), 457–471 (See also 299, 795) (2002)
Valiant, L.G.: Holographic Algorithms (Extended Abstract). In: Proc. 45th IEEE Symposium on Foundations of Computer Science, pp. 306–315. IEEE Computer Society Press, Los Alamitos (A more detailed version appeared in Electronic Colloquium on Computational Complexity Report TR05-099) (2004)
Valiant, L.G.: Holographic circuits. In: Caires, L., et al. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1–15. Springer, Heidelberg (2005)
Valiant, L.G.: Completeness for parity problems. In: Proc. 11th International Computing and Combinatorics Conference (2005)
Valiant, L.G.: Accidental Algorithms. In: Proc. 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 509–517. IEEE Computer Society Press, Los Alamitos (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Cai, JY., Lu, P. (2007). On Symmetric Signatures in Holographic Algorithms. In: Thomas, W., Weil, P. (eds) STACS 2007. STACS 2007. Lecture Notes in Computer Science, vol 4393. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70918-3_37
Download citation
DOI: https://doi.org/10.1007/978-3-540-70918-3_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70917-6
Online ISBN: 978-3-540-70918-3
eBook Packages: Computer ScienceComputer Science (R0)