Sciweavers

1169 search results - page 1 / 234
» Degrees of monotone complexity
Sort
View
JSYML
2006
86views more  JSYML 2006»
13 years 4 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
JSYML
2010
71views more  JSYML 2010»
13 years 3 months ago
Limitwise monotonic functions, sets, and degrees on computable domains
We extend the notion of limitwise monotonic functions to include arbitrary computable domains. We then study which sets and degrees are support increasing (support strictly increas...
Asher M. Kach, Daniel Turetsky
NIPS
2003
13 years 6 months ago
Approximability of Probability Distributions
We consider the question of how well a given distribution can be approximated with probabilistic graphical models. We introduce a new parameter, effective treewidth, that captures...
Alina Beygelzimer, Irina Rish
DBPL
1997
Springer
117views Database» more  DBPL 1997»
13 years 8 months ago
Degrees of Monotonicity of Spatial Transformations
We consider spatial databases that can be defined in terms of polynomial inequalities, and we are interested in monotonic transformations of spatial databases. We investigate a hi...
Bart Kuijpers
ECCC
2002
103views more  ECCC 2002»
13 years 4 months ago
Monotone complexity and the rank of matrices
We shall give simpler proofs of some lower bounds on monotone computations. We describe a simple condition on combinatorial structures, such that the rank of the matrix associated...
Pavel Pudlák