11949 search results - page 168 / 2390 » Some results on (a:b)-choosability |
ENTCS
2008
15 years 1 months ago
2008
: We define and compare several probabilistic notions of computability for mappings from represented spaces (that are equipped with a measure or outer measure) into computable metr...
APAL
2006
15 years 1 months ago
2006
The paper shows elimination of imaginaries for real closed valued fields to the geometric sorts which were introduced in the [6]. We also show that this result is in some sense op...
CORR
2006
Springer
15 years 1 months ago
2006
Springer
This paper describes a general framework for converting online game playing algorithms into constrained convex optimization algorithms. This framework allows us to convert the wel...
114
click to vote
EJC
2006
15 years 1 months ago
2006
Abstract. We start with a bijective proof of Schur's theorem due to Alladi and Gordon and describe how a particular iteration of it leads to some very general theorems on colo...
IEICET
2008
15 years 1 months ago
2008
In this paper, we suggest that all pairings be in a group from an abstract angle. According to our results, we can define some new pairings with short Miller loops and hence speed ...