16 search results - page 1 / 4 » On Symmetric Signatures in Holographic Algorithms |
STACS
2007
Springer
15 years 18 days ago
2007
Springer
In holographic algorithms, symmetric signatures have been particularly useful. We give a complete characterization of these symmet
SIAMCOMP
2008
14 years 6 months ago
2008
Leslie Valiant recently proposed a theory of holographic algorithms. These novel algorithms achieve exponential speed-ups for certain computational problems compared to naive algo...
COCO
2007
Springer
15 years 20 days ago
2007
Springer
Valiant has proposed a new theory of algorithmic computation based on perfect matchings and Pfaffians. We study the properties of matchgates—the basic building blocks in this n...
FOCS
2007
IEEE
15 years 25 days ago
2007
IEEE
We show that every construction of one-time signature schemes from a random oracle achieves black-box security at most 2(1+o(1))q , where q is the total number of oracle queries a...
IROS
2009
IEEE
15 years 1 months ago
2009
IEEE
— In our previous works we had developed a framework for self-reconfiguration planning based on graph signature and graph edit-distance. The graph signature is a fast isomorphism...