By Topic

On Holant theorem and its proof

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Al-Bashabsheh, A. ; Sch. of Inf. Technol. & Eng., Univ. of Ottawa, Ottawa, ON, Canada ; Yongyi Mao ; Yongacoglu, A.

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. The proof is simpler and more direct compared with previous works. 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.

Published in:

Communications (QBSC), 2010 25th Biennial Symposium on

Date of Conference:

12-14 May 2010