Computer Science – Computational Complexity
Scientific paper
2009-11-15
Computer Science
Computational Complexity
Fixed small typo in Section 3.6
Scientific paper
We provide a recursive description of the signatures realizable on the
standard basis by a holographic algorithm. The description allows us to prove
tight bounds on the size of planar matchgates and efficiently test for standard
signatures. Over finite fields, it allows us to count the number of n-bit
standard signatures and calculate their expected sparsity.
No associations
LandOfFree
A Recursive Definition of the Holographic Standard Signature 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 A Recursive Definition of the Holographic Standard Signature, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Recursive Definition of the Holographic Standard Signature will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-324185