Sciweavers

4581 search results - page 3 / 917
» Computing Transformation Semigroups
Sort
View
66
Voted
SOFSEM
2010
Springer
15 years 8 months ago
Efficient Testing of Equivalence of Words in a Free Idempotent Semigroup
Jakub Radoszewski, Wojciech Rytter
DCC
2005
IEEE
15 years 11 months ago
Weierstrass Semigroups and Codes from a Quotient of the Hermitian Curve
We consider the quotient of the Hermitian curve defined by the
Gretchen L. Matthews
82
Voted
COCOON
2003
Springer
15 years 4 months ago
The Complexity of Boolean Matrix Root Computation
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...
Martin Kutz
86
Voted
FOCS
1990
IEEE
15 years 3 months ago
Complexity of Unification in Free Groups and Free Semi-groups
The exponent of periodicity is an important factor in estimates of complexity of word-unification algorithms. We prove that the exponent of periodicity of a minimal solution of a w...
Antoni Koscielski, Leszek Pacholski