Pages that link to "Item:Q5096159"

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 (Q5096159):

Displaying 7 items.

• If deterministic and nondeterministic space complexities are equal for log log n, then they are also equal for log n (Q914371) (← links)
• Remarks on languages acceptable in log log n space (Q1107318) (← 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)
• Two-way automata versus logarithmic space (Q2254505) (← 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)
• Trading determinism for time in space bounded computations (Q4608568) (← links)