A Recursive Definition of the Holographic Standard Signature

Computer Science – Computational Complexity

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-324185

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.