Tag: nondeterminism

Found 31 results for 'nondeterminism'.

1) cc.complexity-theory - Can graph isomorphism be decided with square root bounded nondeterminism?
2) graph-algorithms - What are the obstructions to extending $L=SL$ to $L=NL$?
3) cc.complexity-theory - How powerful are nondeterministic constant-depth circuits?
4) fl.formal-languages - Büchi automata with acceptance strategy
5) cc.complexity-theory - On Defining Probabilistic/Nondeterministic Circuits
6) cc.complexity-theory - Separation of limited nondeterminism classes?
7) cc.complexity-theory - Is $L \subset 1NL$ when $L \neq NL$?
8) cc.complexity-theory - Nondeterministic speed-up of deterministic computation
9) cc.complexity-theory - Consequences of $\mathsf{NP}$ containing $\mathsf{BPP}$
10) cc.complexity-theory - Example demonstrating the power of non-deterministic circuits
11) ds.algorithms - Deciding emptiness of intersection of regular languages in subquadratic time
12) cc.complexity-theory - Number of minimal DFAs of size at most $m$?
13) fl.formal-languages - Size bound on Büchi automaton for complement
14) np-hardness - Determining if a word of specific length exists that is not accepted by a NFA
15) cc.complexity-theory - Nondeterminism is on average useless for circuits?
16) cc.complexity-theory - Are there natural separations in the nondeterministic time hierarchy?
17) automata-theory - NFA to DFA Powerset Construction : A Partial determinization algorithm with trade-off between running time and size for the resulting automata?
18) fl.formal-languages - Does XOR automata (NXA) for finite languages benefit from cycles?
19) sat - How is the MA version of SETH proven to be false?
20) nondeterminism - Halting time of non deterministic machine
21) reductions - Is there a reduction to "door and pressure plate" games that doesn't explode solution length?
22) cc.complexity-theory - Is there any known NP-Complete (or NP-Intermediate) problem in sublinear nondeterministic space?
23) reference-request - minimal finite automata given in-words and out-words
24) cc.complexity-theory - Implications between $\mathsf{L}=\mathsf{P}$ and $\mathsf{NL}=\mathsf{NP}$?
25) lo.logic - What is an unambiguous language in the sense of Schützenberger?
26) type-theory - Determinism and pi-calculus
27) automata-theory - Number of accepting path of a non deterministic automaton
28) reference-request - Who introduced nondeterministic computation?
29) automata-theory - Conditions for NFA universality
30) circuit-complexity - What do stronger circuit lower bounds give in terms of derandomization?
31) complexity-classes - NLOGTIME versus $\exists$DLOGTIME