全息算法的原理及应用-计算机科学与探索.PDF

ISSN 1673-9418 CODEN JKYTA8 E-mail: fcst@ Journal of Frontiers of Computer Science and Technology 1673-9418/2011/05(02)-0128-19 Tel: +86-10 DOI: 10.3778/j.issn.1673-9418.2011.02.003 * 许道云+ 贵州大学 计算机科学系, 贵阳 550025 * Principles and Applications of Holographic Algorithm + XU Daoyun Department of Computer Science, Guizhou University, Guiyang 550025, China + Corresponding author: E-mail: dyxu@ XU Daoyun. Principles and applications of holographic algorithm. Journal of Frontiers of Computer Science and Technology, 2011, 5(2): 128-146. Abstract: The analysis of basic theory, principle and application method about holographic algorithm is presented for reading and applying easily the algorithm. Examples, such as the counting problem for planar 3-CNF formulas, will help readers to understand some basic principles and applications. The relevant principle and method are helpful to solve some counting problems in combination problems. Key words: holographic algorithm; reduction; counting problem 分析了全息算法的基本理论、原理和使用方法, 旨在简化对全息算法的理解并加以应用; 给出了 几个实例(如平面 3-CNF 公式的计数问题), 以帮助读者理解全息算法中的一些基本原理和方法。相关的原 理和方法对解决某些组合计数问题有所帮助。 ; ; A TP301 1 (A-), x , “ x ∈A ” ( A ≤ B ) A , P *The National Natural Science Foundation of China under Grant No. 60911130038 (); the Govern- ment Foundation of Guizhou Province of China (). Received 2010-02, Accepted 2010-06. 129 A- B- ,