We first consider infinite two-player games on pushdown graphs. In previous work, Cachat, Duparc and Thomas [4] have presented a winning decidable condition that is Σ3-complete ...
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...
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 ...
Mark de Berg, Herman J. Haverkort, Constantinos P....
Abstract. Cortical surface complexity is a potential structural marker for certain diseases such as schizophrenia. In this study, we developed a measure of fractal dimension (FD) c...
Rachel Aine Yotter, Paul M. Thompson, Igor Nenadic...
The work establishes fundamental limits between rate, reliability and computational complexity, for the general setting of outage-limited MIMO communications. In the high-SNR regim...