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.
Jin-Yi Cai, Pinyan Lu, Mingji Xia, "Holographic Algorithms by Fibonacci Gates and Holographic Reductions for Hardness", FOCS, 2008, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science 2008, pp. 644-653, doi:10.1109/FOCS.2008.34