3818 search results - page 84 / 764 » Word Problems on Compressed Words |
106
click to vote
DAM
2007
15 years 4 months ago
2007
We study a many-to-many generalisation of the well-known stable roommates problem in which each participant seeks to be matched with a number of others. We present a linear-time a...
119
click to vote
CORR
2002
Springer
15 years 4 months ago
2002
Springer
We give a precise definition of "generic-case complexity" and show that for a very large class of finitely generated groups the classical decision problems of group theor...
147
click to vote
DAM
2002
15 years 4 months ago
2002
It is proved that seven different approaches to the multi-peg Tower of Hanoi problem are all equivalent. Among them the classical approaches of Stewart and Frame from 1941 can be ...
122
click to vote
ORL
2007
15 years 4 months ago
2007
A method that utilizes the polynomially solvable critical independent set problem for solving the maximum independent set problem on graphs with a nonempty critical independent se...
122
click to vote
AISC
2006
Springer
15 years 8 months ago
2006
Springer
We prove that the properties of reachability, joinability and confluence are undecidable for flat TRSs. Here, a TRS is flat if the heights of the left and right-hand sides of each ...