93 search results - page 19 / 19 » Unifying Zero-Knowledge Proofs of Knowledge |
TALG
2008
13 years 7 months ago
2008
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...
GOSLER
1995
13 years 11 months ago
1995
The present paper deals with the learnability of indexed families of uniformly recursive languages from positive data as well as from both, positive and negative data. We consider...
JSC
2010
13 years 2 months ago
2010
Both Sequence and Context Unification generalize the same problem: Word Unification. Besides that, Sequence Unification solves equations between unranked terms involving sequence ...