Pages that link to "Item:Q5385338"

The following pages link to An <i>O</i> (log( <i>n</i> ) ^4/3 ) space algorithm for ( <i>s, t</i> ) connectivity in undirected graphs (Q5385338):

Displaying 18 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)
• A fast randomized LOGSPACE algorithm for graph connectivity (Q1349893) (← links)
• A space lower bound for \(st\)-connectivity on node-named JAGs (Q1566733) (← links)
• The complexity of planarity testing (Q1887150) (← links)
• Random walks on graphs and Monte Carlo methods (Q2229041) (← links)
• Relating Sublinear Space Computability Among Graph Connectivity and Related Problems (Q2794336) (← links)
• STCON in Directed Unique-Path Graphs (Q3165964) (← links)
• Undirected ST-connectivity in log-space (Q3581436) (← links)
• Undirected connectivity in log-space (Q3604402) (← links)
• An $O(\logn \log\logn)$ Space Algorithm for Undirected st-Connectivity (Q3624373) (← links)
• Undirected connectivity in \(O(\log^{1. 5} n)\) space (Q4230323) (← links)
• A fast randomized LOGSPACE algorithm for graph connectivity (Q4632451) (← links)
• The Bounded and Precise Word Problems for Presentations of Groups (Q5113919) (← links)
• Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs (Q5130845) (← links)
• Many Random Walks Are Faster Than One (Q5199503) (← links)
• StUSPACE(log n) ⊂-DSPACE(log2 n/log log n) (Q6487439) (← links)