Pages that link to "Item:Q4230323"

The following pages link to Undirected connectivity in \(O(\log^{1. 5} n)\) space (Q4230323):

Displaying 13 items.

• Pseudorandom generators for combinatorial checkerboards (Q395607) (← links)
• Undirected \(s\)--\(t\) connectivity in polynomial time and sublinear space (Q677988) (← links)
• RUSPACE\((\log n)\subseteq \text{DSPACE}(\log^2n/\log \log n)\) (Q1271273) (← links)
• Log-space constructible universal traversal sequences for cycles of length O(\(n^{4.03}\)). (Q1401264) (← links)
• Improved algorithms via approximations of probability distributions (Q1582012) (← links)
• Universal traversal sequences with backtracking. (Q1872734) (← links)
• The complexity of planarity testing (Q1887150) (← links)
• Relating Sublinear Space Computability Among Graph Connectivity and Related Problems (Q2794336) (← links)
• Undirected ST-connectivity in log-space (Q3581436) (← links)
• An unambiguous class possessing a complete set (Q5048936) (← links)
• Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs (Q5130845) (← links)
• An <i>O</i> (log( <i>n</i> ) ^4/3 ) space algorithm for ( <i>s, t</i> ) connectivity in undirected graphs (Q5385338) (← links)
• StUSPACE(log n) ⊂-DSPACE(log2 n/log log n) (Q6487439) (← links)