1055 search results - page 6 / 211 » Enumerations in computable structure theory |
CPM
2007
Springer
13 years 11 months ago
2007
Springer
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
JSYML
2008
13 years 7 months ago
2008
We say that A LR B if every B-random number is A-random. Intuitively this means that if oracle A can identify some patterns on some real , oracle B can also find patterns on . In o...
CIE
2007
Springer
14 years 1 months ago
2007
Springer
ACL
1996
13 years 9 months ago
1996
JCT
2011
13 years 2 months ago
2011
For a positive integer n that is not a power of 2, precisely the same family of convex polygons with n sides is optimal in three different geometric problems. These polygons have ...