Pages that link to "Item:Q914371"

The following pages link to If deterministic and nondeterministic space complexities are equal for log log n, then they are also equal for log n (Q914371):

Displaying 10 items.

• Space bounded computations: Review and new separation results (Q1176238) (← links)
• A survey of space complexity (Q1193412) (← links)
• Bridging across the \(\log(n)\) space frontier (Q1271619) (← links)
• DSPACE(\(n\)) \(\overset {?} =\) NSPACE(\(n\)): A degree theoretic characterization (Q1362330) (← links)
• Some notes on strong and weak log log n space complexity (Q1824397) (← links)
• Some remarks on the alternating hierarchy and closure under complement for sublogarithmic space (Q1825656) (← links)
• Uniform constant-depth threshold circuits for division and iterated multiplication. (Q1872733) (← links)
• Weak mode of space complexity can be used in the proof that \([DSPACE({\l}og{\l}og n)\) = \(NSPACE({\l}og{\l}og n)\)] \(\Rightarrow\) [\(L = NL]\) (Q3971288) (← links)
• Nondeterministic Computations in Sublogarithmic Space and Space Constructibility (Q3978779) (← links)
• If deterministic and nondeterministic space complexities are equal for log log n then they are also equal for log n (Q5096159) (← links)