2008 49th Annual IEEE Symposium on Foundations of Computer Science (2008)
Oct. 25, 2008 to Oct. 28, 2008
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FOCS.2008.34
We propose a new method to prove complexity dichotomy theorems. First we introduce Fibonacci gates which provide a new class of polynomial time holographic algorithms. Then we develop holographic reductions. We show that holographic reductions followed by interpolations provide a uniform strategy to prove \#P-hardness.
J. Cai, P. Lu and M. Xia, "Holographic Algorithms by Fibonacci Gates and Holographic Reductions for Hardness," 2008 49th Annual IEEE Symposium on Foundations of Computer Science(FOCS), vol. 00, no. , pp. 644-653, 2008.