Abstract. A Solovay function is a computable upper bound g for prefixfree Kolmogorov complexity K that is nontrivial in the sense that g agrees with K, up to some additive constan...
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
mRNA molecules are folded in the cells and therefore many of their substrings may actually be inaccessible to protein and microRNA binding. The need to apply an accessability crite...
Ydo Wexler, Chaya Ben-Zaken Zilberstein, Michal Zi...