2150 search results - page 64 / 430 » On a restricted cross-intersection problem |
128
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r(n), there are several furth...
138
click to vote
JUCS
2010
15 years 2 months ago
2010
Abstract: We study the number of matching substrings in the pattern matching problem. In general, there can be a quadratic number of matching substrings in the size of a given text...
123
click to vote
WEA
2005
Springer
15 years 10 months ago
2005
Springer
We present a general framework for approximating several NP-hard problems that have two underlying properties in common. First, the problems we consider can be formulated as intege...
111
click to vote
RTA
2000
Springer
15 years 8 months ago
2000
Springer
We consider the problem of higher-order matching restricted et of linear -terms (i.e., -terms where each abstraction x. M is such that there is exactly one free occurrence of x in ...
104
click to vote
DAGSTUHL
2006
15 years 5 months ago
2006
Abstract. The general intractability of the constraint satisfaction problem (CSP) has motivated the study of the complexity of restricted cases of this problem. Thus far, the liter...