Sciweavers

Share
CIE
2009
Springer
8 years 5 months ago
Immunity for Closed Sets
Douglas Cenzer, Rebecca Weber, Guohua Wu
CIE
2009
Springer
8 years 11 months ago
Functions Definable by Arithmetic Circuits
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...
Ian Pratt-Hartmann, Ivo Düntsch
CIE
2009
Springer
8 years 11 months ago
Algorithmic Minimal Sufficient Statistic Revisited
Abstract. We express some criticism about the definition of an algorithmic sufficient statistic and, in particular, of an algorithmic minimal sufficient statistic. We propose anoth...
Nikolay K. Vereshchagin
CIE
2009
Springer
8 years 11 months ago
Spectra of Algebraic Fields and Subfields
An algebraic field extension of Q or Z/(p) may be regarded either as a structure in its own right, or as a subfield of its algebraic closure F (either Q or Z/(p)). We consider the ...
Andrey Frolov, Iskander Sh. Kalimullin, Russell Mi...
CIE
2009
Springer
8 years 11 months ago
The First Order Theories of the Medvedev and Muchnik Lattices
We show that the first order theories of the Medevdev lattice and the Muchnik lattice are both computably isomorphic to the third order theory of the natural numbers.
Andrew Lewis, André Nies, Andrea Sorbi
CIE
2009
Springer
9 years 1 months ago
Stochastic Programs and Hybrid Automata for (Biological) Modeling
We present a technique to associate to stochastic programs written in stochastic Concurrent Constraint Programming a semantics in terms of a lattice of hybrid automata. The aim of ...
Luca Bortolussi, Alberto Policriti
CIE
2009
Springer
9 years 1 months ago
Complexity of Existential Positive First-Order Logic
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...
Manuel Bodirsky, Miki Hermann, Florian Richoux
CIE
2009
Springer
9 years 1 months ago
Computable Exchangeable Sequences Have Computable de Finetti Measures
Abstract. We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. In the process, we develop machinery for computably ...
Cameron E. Freer, Daniel M. Roy
CIE
2009
Springer
9 years 1 months ago
Relationship between Kanamori-McAloon Principle and Paris-Harrington Theorem
We give a combinatorial proof of a tight relationship between the Kanamori-McAloon principle and the Paris-Harrington theorem with a number-theoretic parameter function. We show th...
Gyesik Lee
CIE
2009
Springer
9 years 1 months ago
Cutting Planes and the Parameter Cutwidth
We introduce the parameter cutwidth for the Cutting Planes (CP) system of Gomory and Chv´atal. We provide linear lower bounds on cutwidth for two simple polytopes. Considering CP ...
Stefan S. Dantchev, Barnaby Martin
books