… We assume the reader is familiar with basic computationalcomplexity; a good reference is [2]. The complexity class L denotes the problems solvable in log-space, while PSPACE is the …
T Pitassi, M Shirley, T Watson - computational complexity, 2021 - Springer
… the Nondeterministic and Randomized Boolean Hierarchies, … complexity classes within and across these two hierarchies. In particular, we prove that the Randomized Boolean Hierarchy …
… Furthermore, I speculate about future developments of computationalcomplexity and I … computationalcomplexity. In the opposite direction I discuss how the computationalcomplexity …
Z Lu, IC Oliveira, R Santhanam - Proceedings of the 53rd Annual ACM …, 2021 - dl.acm.org
… This implies that 𝐿𝑘 ∈ BPP/1 by using a constructive upper bound for this regime of time complexity. We first specify the … A hierarchy for nondeterministictimecomplexity. J. Comput. …
… those graph problems that can be computed locally in nondeterministic constant time. … time."" Because of the nature of the proof, we care about what the timecomplexity is when n …
S Schmitz - ACM Transactions on Computation Theory (TOCT), 2016 - dl.acm.org
… Indeed, we can easily simulate the oracle machine for A using a nondeterministic Turing transducer also in time f(n) that guesses the answers of the B oracle and writes a conjunction of …
… structure. In addition to specific problems, our method can be used to explain why the structure … We show that, under SETH, the maximum timecomplexity for such a property expressible …
YS Han, A Salomaa, K Salomaa - Acta Cybernetica, 2017 - cyber.bibl.u-szeged.hu
… and on various nondeterminism measures for finite automata. In particular, we focus on state complexity comparisons between NFAs with quantified ambiguity or nondeterminism. …
… Say we want to show a hierarchy for DTIME, like we do in the complexity … ) time. Assume towards contradiction that there exists a nondeterministic TM M running in nondeterministictime …