1431 search results - page 3 / 287 » The complexity of random ordered structures |
139
Voted
ISAAC
2010
Springer
14 years 10 months ago
2010
Springer
We study line systems in metric spaces induced by graphs. A line is a subset of vertices defined by a relation of betweeness. We show that the class of all graphs having exactly k ...
JSYML
2006
15 years 15 days ago
2006
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...
103
click to vote
CORR
2012
Springer
13 years 8 months ago
2012
Springer
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
114
Voted
CORR
2007
Springer
15 years 15 days ago
2007
Springer
We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a...
102
Voted
CSL
2010
Springer
15 years 1 months ago
2010
Springer
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over fixed, finite structures B. This may be seen as a natural generalisation of th...