173 search results - page 10 / 35 » Groups with poly-context-free word problem |
ECCC
2006
13 years 7 months ago
2006
We investigate the computational complexity of finding an element of a permutation group H Sn with a minimal distance to a given Sn, for different metrics on Sn. We assume that...
INFORMATICALT
2006
13 years 7 months ago
2006
One important requirement of electronic cash systems is the anonymity of customers. Unconditional anonymity is also very well suited to support criminals in blackmailing. Maitland ...
APAL
2005
13 years 7 months ago
2005
Abstract. We prove that a finitely generated group is context-free whenever its Cayleygraph has a decidable monadic second-order theory. Hence, by the seminal work of Muller and Sc...
EUROCRYPT
2003
Springer
14 years 24 days ago
2003
Springer
At CRYPTO 2000, a new public-key encryption based on braid groups was introduced. This paper demonstrates how to solve its underlying problem using the Burau representation. By thi...
VIIP
2001
13 years 9 months ago
2001
This work addresses the problem of automatic tracking of pedestrians observed by a fixed camera in outdoor scenes. Tracking isolated pedestrians is not a difficult task. The chall...