54 search results - page 8 / 11 » q-Partition algebra combinatorics |
CPM
2006
Springer
14 years 4 days ago
2006
Springer
We consider the problem of tiling a segment {0, . . . , n} of the discrete line. More precisely, we ought to characterize the structure of the patterns that tile a segment and thei...
CIE
2006
Springer
14 years 4 days ago
2006
Springer
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
LATA
2010
Springer
13 years 11 months ago
2010
Springer
The problem of classifying all the avoidable binary patterns in words has been completely solved (see Chapter 3 of M. Lothaire, Algebraic Combinatorics on Words, Cambridge Universi...
COMPGEOM
2005
ACM
13 years 10 months ago
2005
ACM
In this paper, we bound the difference between the total mean curvatures of two closed surfaces in R3 in terms of their total absolute curvatures and the Fr´echet distance betwee...
STACS
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...