117
click to vote
CSR
2006
Springer
15 years 7 months ago
2006
Springer
Given two strings (a text t of length n and a pattern p) and a natural number w, window subsequence problems consist in deciding whether p occurs as a subsequence of t and/or findi...
117
click to vote
CSR
2006
Springer
15 years 7 months ago
2006
Springer
We classify the computational complexity of all constraint satisfaction problems where the constraint language is preserved by all permutations of the domain. A constraint languag...
CSR
2006
Springer
15 years 7 months ago
2006
Springer
125
click to vote
CSR
2006
Springer
15 years 7 months ago
2006
Springer
A central object of study in the field of algorithmic randomness are notions of randomness for sequences, i.e., infinite sequences of zeros and ones. These notions are usually def...
CSR
2006
Springer
15 years 7 months ago
2006
Springer
