Computer Science – Information Theory
Scientific paper
2010-05-08
Computer Science
Information Theory
25th Queen's Biennial Symposium on Communications.
Scientific paper
Holographic algorithms are a recent breakthrough in computer science and has found applications in information theory. This paper provides a proof to the central component of holographic algorithms, namely, the Holant theorem. Compared with previous works, the proof appears simpler and more direct. Along the proof, we also develop a mathematical tool, which we call c-tensor. We expect the notion of c-tensor may be applicable over a wide range of analysis.
Al-Bashabsheh Ali
Mao Yongyi
Yongacoglu Abbas
No associations
LandOfFree
On Holant Theorem and Its Proof does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On Holant Theorem and Its Proof, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Holant Theorem and Its Proof will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-303578