516 search results - page 89 / 104 » Sets of k-Independent Strings |
PODS
2009
ACM
14 years 9 months ago
2009
ACM
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
STOC
2010
ACM
14 years 1 months ago
2010
ACM
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
RTA
2010
Springer
14 years 16 days ago
2010
Springer
Data words and data trees appear in verification and XML processing. The term “data” means that positions of the word, or tree, are decorated with elements of an infinite set...
BMCBI
2007
13 years 8 months ago
2007
Background: Similarity of sequences is a key mathematical notion for Classification and Phylogenetic studies in Biology. It is currently primarily handled using alignments. Howeve...
JCSS
2000
13 years 8 months ago
2000
It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential second-order logic ( 1 1), which allows sentences c...