Pages that link to "Item:Q1117703"

The following pages link to Universal traversal sequences of length \(n^{0(\log \,n)}\) for cliques (Q1117703):

Displayed 10 items.

• Undirected \(s\)--\(t\) connectivity in polynomial time and sublinear space (Q677988) ‎ (← links)
• Impact of memory size on graph exploration capability (Q947116) ‎ (← links)
• Lower bounds on the length of universal traversal sequences (Q1201151) ‎ (← links)
• Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs (Q1201152) ‎ (← links)
• Pseudorandom generators for space-bounded computation (Q1204523) ‎ (← links)
• Log-space constructible universal traversal sequences for cycles of length O(\(n^{4.03}\)). (Q1401264) ‎ (← links)
• Universal traversal sequences for expander graphs (Q1802060) ‎ (← links)
• Universal traversal sequences with backtracking. (Q1872734) ‎ (← links)
• Graph exploration by a finite automaton (Q2575752) ‎ (← links)
• Memory Efficient Anonymous Graph Exploration (Q5302040) ‎ (← links)