11740 search results - page 217 / 2348 » More Problems in Rewriting |
137
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
There are several public key establishment protocols as well as complete public key cryptosystems based on allegedly hard problems from combinatorial (semi)group theory known by no...
130
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
In this paper we initiate the study of the AND-OR directed feedback vertex set problem from the viewpoint of approximation algorithms. This AND-OR feedback vertex set problem is m...
157
click to vote
ASIACRYPT
2001
Springer
15 years 8 months ago
2001
Springer
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
139
click to vote
DAM
2008
15 years 4 months ago
2008
We describe the most efficient solutions to the word problem of Artin's braid group known so far, i.e., in other words, the most efficient solutions to the braid isotopy probl...
113
click to vote
EOR
2010
15 years 4 months ago
2010
A significant input-data uncertainty is often present in practical situations. One approach to coping with this uncertainty is to describe the uncertainty with scenarios. A scenar...