13603 search results - page 397 / 2721 » On the Computational Complexity of Cut-Reduction |
200
click to vote
COCO
2003
Springer
16 years 25 days 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...
195
click to vote
COMPGEOM
2009
ACM
16 years 8 days ago
2009
ACM
We study the complexity of the visibility map of terrains whose triangles are fat, not too steep and have roughly the same size. It is known that the complexity of the visibility ...
236
click to vote
SAC
2010
ACM
16 years 2 months ago
2010
ACM
Modern networks are very complex. It is highly desirable to reduce management complexity in next generation network design. Researchers have been seeking inspiration in natural ob...
195
click to vote
FDG
2009
ACM
16 years 2 months ago
2009
ACM
As the interactive entertainment industry matures, a better understanding of what makes software entertaining is needed. A natural starting point is the application of traditional...
187
click to vote
IPPS
2003
IEEE
16 years 27 days ago
2003
IEEE
This paper presents a technique, called loop dissevering, to temporally partitioning any type of loop presented in programming languages. The technique can be used in the presence...