Pages that link to "Item:Q1107318"

The following pages link to Remarks on languages acceptable in log log n space (Q1107318):

Displaying 14 items.

• If deterministic and nondeterministic space complexities are equal for log log n, then they are also equal for log n (Q914371) (← links)
• A new complete language for DSPACE(log n) (Q1123607) (← links)
• A survey of space complexity (Q1193412) (← links)
• A remark on middle space bounded alternating Turing machines (Q1350303) (← links)
• Gap-languages and log-time complexity classes (Q1389651) (← 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)
• A space lower bound for acceptance by one-way \(\Pi_2\)-alternating machines (Q2720409) (← links)
• TESTING THE DESCRIPTIONAL POWER OF SMALL TURING MACHINES ON NONREGULAR LANGUAGE ACCEPTANCE (Q3526538) (← 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)
• (Q4371015) (← links)
• Lower Space Bounds for Accepting Shuffle Languages (Q4718896) (← links)
• If deterministic and nondeterministic space complexities are equal for log log n then they are also equal for log n (Q5096159) (← links)
• TIGHT BOUNDS FOR THE SPACE COMPLEXITY OF NONREGULAR LANGUAGE RECOGNITION BY REAL-TIME MACHINES (Q5168415) (← links)