1071 search results - page 1 / 215 » Programming with enumerable sets of structures |
AML
2010
13 years 5 months ago
2010
Abstract We prove that a sequence of sets containing representatives of cupping partners for every nonzero 0 2 enumeration degree cannot have a 0 2 enumeration. We also prove that ...
COMPGEOM
1991
ACM
13 years 9 months ago
1991
ACM
We present a new pivot-based algorithm which can be used with minor modification for the enumeration of the facets of the convex hull of a set of points, or for the enumeration o...
APAL
1998
13 years 5 months ago
1998
We consider the computably enumerable sets under the relation of Qreducibility. We first give several results comparing the upper semilattice of c.e. Q-degrees, RQ, ≤Q , under ...
WCRE
1996
IEEE
13 years 9 months ago
1996
IEEE
An important challenge in software reengineering is to encapsulate collections of related data that, due to the absence of appropriate constructs for encapsulation in legacy progr...
CIE
2005
Springer
13 years 11 months ago
2005
Springer
The strong weak truth table reducibility was suggested by Downey, Hirschfeldt, and LaForte as a measure of relative randomness, alternative to the Solovay reducibility. It also occ...