28 search results - page 3 / 6 » cie 2009 |
CIE
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Let Fq be a finite field with q elements. We produce an (effective) elimination of quantifiers for the structure of the set of polynomials, Fq[t], of one variable, in...
CIE
2009
Springer
14 years 2 months ago
2009
Springer
Let Γ be a (not necessarily finite) structure with a finite relational signature. We prove that deciding whether a given existential positive sentence holds in Γ is in LOGSPACE...
CIE
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. The members of Martin-L¨of random closed sets under a distribution studied by Barmpalias et al. are exactly the infinite paths through Martin-L¨of random Galton-Watson...
CIE
2009
Springer
13 years 11 months ago
2009
Springer
An arithmetic circuit is a labelled, directed, acyclic graph specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. In this pap...
CIE
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We prove various results on effective numberings and Friedberg numberings of families related to algorithmic randomness. The family of all Martin-L¨of random left-compu...