13 search results - page 2 / 3 » coco 1998 |
COCO
1998
Springer
13 years 9 months ago
1998
Springer
Ladner [18] showed that there are no minimal recursive sets under polynomial-time reductions. Given any recursive set A, Ladner constructs a set B such that B strictly reduces to ...
COCO
1998
Springer
13 years 9 months ago
1998
Springer
We show that the perfect matching problem is in the complexity class SPL in the nonuniform setting. This provides a better upper bound on the complexity of the matching problem, a...
COCO
1998
Springer
13 years 9 months ago
1998
Springer
We define probabilistic martingales based on randomized approximation schemes, and show that the resulting notion of probabilistic measure has several desirable robustness propert...
COCOS
2003
Springer
13 years 10 months ago
2003
Springer
This paper details a technique, called inter-block backtracking (IBB), which improves interval solving of decomposed systems with non-linear equations over the reals. This techniqu...
COCO
2000
Springer
13 years 9 months ago
2000
Springer
Kolmogorov’s very first paper on algorithmic information theory (Kolmogorov, Problemy peredachi infotmatsii 1(1) (1965), 3) was entitled “Three approaches to the definition ...