Sciweavers

10 search results - page 1 / 2
» Computability-theoretic complexity of countable structures
Sort
View
STACS
2005
Springer
15 years 4 months ago
The Core of a Countably Categorical Structure
ded abstract of this article is published in the proceedings of STACS’05, LNCS 3404, Springer Verlag. A relational structure is a core, if all its endomorphisms are embeddings. T...
Manuel Bodirsky
CSL
2003
Springer
15 years 3 months ago
Constraint Satisfaction with Countable Homogeneous Templates
For a fixed countable homogeneous relational structure Γ we study the computational problem whether a given finite structure of the same signature homomorphically maps to Γ. T...
Manuel Bodirsky, Jaroslav Nesetril
JSYML
2006
86views more  JSYML 2006»
14 years 10 months ago
Degrees of monotone complexity
Levin and Schnorr (independently) introduced the monotone complexity, Km(), of a binary string . We use monotone complexity to define the relative complexity (or relative randomnes...
William C. Calhoun
IJSI
2008
91views more  IJSI 2008»
14 years 10 months ago
Random Event Structures
Abstract In a line of recent development, probabilistic constructions of universal, homogeneous objects have been provided in various categories of ordered structures, such as caus...
Manfred Droste, Guo-Qiang Zhang