1996 search results - page 140 / 400 » Financial Theory 2 |
149
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
We prove that the single-player game clobber is solvable in linear time when played on a line or on a cycle. For this purpose, we show that this game is equivalent to an optimizat...
134
click to vote
JUCS
2008
15 years 4 months ago
2008
: The topological pressure of dynamical systems theory is examined from a computability theoretic point of view. It is shown that for sofic shift dynamical systems, the topological...
104
click to vote
JSYML
2006
15 years 4 months ago
2006
In [Sca99], T. Scanlon proved a quantifier elimination result for valued D-fields in a three-sorted language by using angular component functions. Here we prove an analogous theore...
153
click to vote
SIAMCOMP
2008
15 years 4 months ago
2008
Abstract. We present efficient compression algorithms for subgroups of multiplicative groups of finite fields, we use our compression algorithms to construct efficient public key c...
139
click to vote
SIGACT
2008
15 years 4 months ago
2008
Two long-open problems have been solved: (1) every sufficiently large planar point set in general position contains the vertices of an empty hexagon; (2) every finite collection o...