179 search results - page 5 / 36 » Space Bounded Computations: Review And New Separation Result... |
COCO
2003
Springer
15 years 3 months ago
2003
Springer
We review and slightly strengthen known results on the Kolmogorov complexity of prefixes of effectively random sequences. First, there are recursively random random sequences su...
SIAMCOMP
2008
14 years 10 months ago
2008
We present a new algorithm to compute a subset S of vertices of a planar graph G whose removal partitions G into O(N/h) subgraphs of size O(h) and with boundary size O( h) each. ...
73
Voted
TIT
2008
14 years 10 months ago
2008
This paper derives an improved sphere-packing (ISP) bound for finite-length error-correcting codes whose transmission takes place over symmetric memoryless channels, and the codes...
AAAI
1997
14 years 11 months ago
1997
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
90
Voted
BIRTHDAY
2010
Springer
14 years 11 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...