全息算法的原理及应用

计算机科学与探索 ›› 2011, Vol. 5 ›› Issue (2): 128-146.

全息算法的原理及应用

许道云

贵州大学计算机科学系, 贵阳 550025

收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2011-02-01 发布日期:2011-02-01
通讯作者: 许道云

Principles and Applications of Holographic Algorithm

XU Daoyun

Department of Computer Science, Guizhou University, Guiyang 550025, China

Received:1900-01-01 Revised:1900-01-01 Online:2011-02-01 Published:2011-02-01
Contact: XU Daoyun

摘要/Abstract

摘要： 分析了全息算法的基本理论、原理和使用方法, 旨在简化对全息算法的理解并加以应用; 给出了几个实例(如平面3-CNF公式的计数问题), 以帮助读者理解全息算法中的一些基本原理和方法。相关的原理和方法对解决某些组合计数问题有所帮助。

关键词: 全息算法, 归约, 计数问题

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

许道云. 全息算法的原理及应用[J]. 计算机科学与探索, 2011, 5(2): 128-146.

XU Daoyun. Principles and Applications of Holographic Algorithm[J]. Journal of Frontiers of Computer Science and Technology, 2011, 5(2): 128-146.