… In this section we study the complexity of the problem of deciding the nondeterminism level
of a given automaton. Note we refer here to the syntactic class (eg, deciding whether a given …

… the Nondeterministic and Randomized Boolean Hierarchies, … complexity classes within and
across these two hierarchies. In particular, we prove that the Randomized Boolean Hierarchy …

… This implies that 𝐿𝑘 ∈ BPP/1 by using a constructive upper bound for this regime of time
complexity. We first specify the … A hierarchy for nondeterministic time complexity. J. Comput. …

… It has cubic time complexity and quadratic space complexity with respect to input length,
leading to higher wall-clock run time than other stack RNNs, but often better task performance. …

… nondeterministic lower bounds we show to be unprovable do not ask for a proof of consistency
of any proof system, ie the nondeterministic … J.; On the computational complexity of finding …

… its nondeterminism can be resolved on-the-fly, by only taking into account the prefix of the
word read so far. This restricted form of nondeterminism … some of the power of nondeterminism. …

We extend the notion of distributed decision in the framework of distributed network computing,
inspired by both the polynomial hierarchy for Turing machines and recent results on so-…

… in computational complexity whether \(\textsf{NEXP}\) (nondeterministic exponential time)
has … method [66], puts many important classical complexity results together, ranging from the …

… We consider various complexity measures which characterize time complexity of decision
trees. One of the most known among them is the depth. The depth of a decision tree is the …

… To model this program by an MDP, we can use two nondeterministic actions for the two
branches of the if statement, such that the choice of different schedulers corresponds to the …