Pages that link to "Item:Q1824397"

The following pages link to Some notes on strong and weak log log n space complexity (Q1824397):

Displaying 6 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)
• A survey of space complexity (Q1193412) (← links)
• Bridging across the \(\log(n)\) space frontier (Q1271619) (← 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)
• If deterministic and nondeterministic space complexities are equal for log log n then they are also equal for log n (Q5096159) (← links)