Sciweavers

2983 search results - page 27 / 597
» The group marriage problem
Sort
View
DAM
2008
114views more  DAM 2008»
13 years 8 months ago
Efficient solutions to the braid isotopy problem
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...
Patrick Dehornoy
EUROCRYPT
2006
Springer
14 years 11 days ago
Security Analysis of the Strong Diffie-Hellman Problem
Let g be an element of prime order p in an abelian group and Zp. We show that if g, g , and gd are given for a positive divisor d of p - 1, we can compute the secret in O(log p
Jung Hee Cheon
ESE
2000
102views Database» more  ESE 2000»
13 years 8 months ago
Picking the Right Problem Frame-An Empirical Study
Problem frames are a relatively new approach to requirements engineering, promising benefits not only in elicitation but also in subsequent design, by allowing their users to selec...
Keith Phalp, Karl Cox
DISOPT
2008
89views more  DISOPT 2008»
13 years 8 months ago
Group sequencing around a common due date
The problem of scheduling groups of jobs on a single machine under the group technology assumption is studied. Jobs of the same group are processed contiguously and a sequence ind...
T. C. Edwin Cheng, Mikhail Y. Kovalyov, C. T. Ng, ...
IJAC
2010
128views more  IJAC 2010»
13 years 7 months ago
Compressed Words and Automorphisms in Fully Residually Free Groups
We show that the compressed word problem in a finitely generated fully residually free group (F-group) is decidable in polynomial time, and use this result to show that the word ...
Jeremy MacDonald