Pages that link to "Item:Q1062759"

The following pages link to Space-bounded hierarchies and probabilistic computations (Q1062759):

Displaying 35 items.

• Relativizing small complexity classes and their theories (Q260396) (← links)
• Decreasing the bandwidth of a transition matrix (Q673904) (← links)
• Multihead two-way probabilistic finite automata (Q675857) (← links)
• New developments in structural complexity theory (Q913509) (← links)
• Reductions to graph isomorphism (Q987394) (← links)
• Consistency in nondeterministic storage (Q1060847) (← links)
• Separation with the Ruzzo, Simon, and Tompa relativization implies DSPACE(log n)\(\neq NSPACE(\log \,n)\) (Q1094139) (← links)
• Decompositions of nondeterministic reductions (Q1108263) (← links)
• Relativized alternation and space-bounded computation (Q1111024) (← links)
• On the complexity of deciding fair termination of probabilistic concurrent finite-state programs (Q1111384) (← links)
• A measure of relativized space which is faithful with respect to depth (Q1115190) (← links)
• The logarithmic alternation hierarchy collapses: \(A\Sigma _ 2^{{\mathcal L}}=A\Pi_ 2^{{\mathcal L}}\) (Q1118407) (← links)
• An NL hierarchy (Q1182111) (← links)
• A survey of space complexity (Q1193412) (← links)
• Upper bounds on recognition of a hierarchy of non-context-free languages (Q1193884) (← links)
• Diagonalization, uniformity, and fixed-point theorems (Q1201287) (← links)
• A very hard log-space counting class (Q1208403) (← links)
• On read-once vs. multiple access to randomness in logspace (Q1208412) (← links)
• Circuits over PP and PL (Q1567408) (← links)
• A note on closure properties of logspace MOD classes (Q1583060) (← links)
• Amplification of slight probabilistic advantage at absolutely no cost in space (Q1607005) (← links)
• Alternating and empty alternating auxiliary stack automata. (Q1874397) (← links)
• Space-efficient informational redundancy (Q1959428) (← links)
• Isolation, matching, and counting uniform and nonuniform upper bounds (Q1961370) (← links)
• Space-bounded quantum complexity (Q1961378) (← links)
• A trichotomy for regular simple path queries on graphs (Q2009646) (← links)
• Self-reducibility (Q2639637) (← links)
• Positive relativizations for log space computability (Q2639638) (← links)
• RelativizedNC (Q3763591) (← links)
• Minimal Reversible Deterministic Finite Automata (Q4640040) (← links)
• Nonuniform complexity classes specified by lower and upper bounds (Q4730777) (← links)
• Relationships among $PL$, $\#L$, and the determinant (Q4889814) (← links)
• (Q5092325) (← links)
• Empty alternation (Q5096908) (← links)
• Power of counting by nonuniform families of polynomial-size finite automata (Q6546609) (← links)