We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...
The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional data exchange, ...
Complex systems exhibit emergent patterns of behavior at different levels of organization. Powerful network analysis methods, developed in physics and social sciences, have been s...
Andre Nash, Christian Bird, Earl T. Barr, Premkuma...
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
The complexity of physical and engineering systems, both in terms of the governing physical phenomena and the number of subprocesses involved, is mirrored in ever more complex mat...