Pages that link to "Item:Q3581436"

The following pages link to Undirected ST-connectivity in log-space (Q3581436):

Displaying 50 items.

• The complexity of intersecting finite automata having few final states (Q347114) (← links)
• The parallel complexity of graph canonization under abelian group action (Q378219) (← links)
• Memoryless routing in convex subdivisions: random walks are optimal (Q419369) (← links)
• More efficient periodic traversal in anonymous undirected graphs (Q442265) (← links)
• Correctness of linear logic proof structures is NL-complete (Q534703) (← links)
• Derandomizing random walks in undirected graphs using locally fair exploration strategies (Q661051) (← links)
• Planar and grid graph reachability problems (Q733742) (← links)
• The equivalence of theories that characterize ALogTime (Q834715) (← links)
• The complexity of constraint satisfaction games and QCSP (Q840700) (← links)
• The complexity of pure literal elimination (Q862401) (← links)
• Distributed chasing of network intruders (Q930899) (← links)
• Fast periodic graph exploration with constant memory (Q931724) (← links)
• Setting port numbers for fast graph exploration (Q935169) (← links)
• Universal algebra and hardness results for constraint satisfaction problems (Q1014634) (← links)
• Affine systems of equations and counting infinitary logic (Q1014638) (← links)
• The complexity of satisfiability problems: Refining Schaefer's theorem (Q1015812) (← links)
• Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (Q1022348) (← links)
• On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls (Q1040040) (← links)
• \(\text{RL}\subseteq \text{SC}\) (Q1327590) (← links)
• A spectrum of time-space trade-offs for undirected \(s-t\) connectivity (Q1356886) (← links)
• Balancing bounded treewidth circuits (Q1678757) (← links)
• The complexity of problems for quantified constraints (Q1959381) (← links)
• The isomorphism problem for planar 3-connected graphs is in unambiguous logspace (Q1959391) (← links)
• Weighted group search on a line \& implications to the priority evacuation problem (Q2098167) (← links)
• Random walks on graphs and Monte Carlo methods (Q2229041) (← links)
• Combinatorial algorithms for distributed graph coloring (Q2251151) (← links)
• On the complexity of matrix rank and rigidity (Q2268340) (← links)
• Derandomized constructions of \(k\)-wise (almost) independent permutations (Q2391191) (← links)
• Graph decomposition for memoryless periodic exploration (Q2429354) (← links)
• Simple agents learn to find their way: an introduction on mapping polygons (Q2446308) (← links)
• Poisson approximation for non-backtracking random walks (Q2655782) (← links)
• On the CSP Dichotomy Conjecture (Q3007637) (← links)
• Bravely, Moderately: A Common Theme in Four Recent Works (Q3088192) (← links)
• Basic Facts about Expander Graphs (Q3088196) (← links)
• Combinatorial Algorithms for Distributed Graph Coloring (Q3095316) (← links)
• STCON in Directed Unique-Path Graphs (Q3165964) (← links)
• Graph Decomposition for Improving Memoryless Periodic Exploration (Q3182950) (← links)
• The Isomorphism Problem for k-Trees Is Complete for Logspace (Q3182953) (← links)
• An Improved Strategy for Exploring a Grid Polygon (Q3408174) (← links)
• A Logspace Algorithm for Partial 2-Tree Canonization (Q3503623) (← links)
• Expander graphs and their applications (Q3514498) (← links)
• Directed st-Connectivity Is Not Expressible in Symmetric Datalog (Q3519500) (← links)
• On Linear Secret Sharing for Connectivity in Directed Graphs (Q3540044) (← links)
• Pure Pointer Programs with Iteration (Q3540172) (← links)
• Finding Reductions Automatically (Q3586003) (← links)
• The Simple Reachability Problem in Switch Graphs (Q3599094) (← links)
• Undirected connectivity in log-space (Q3604402) (← links)
• An $O(\logn \log\logn)$ Space Algorithm for Undirected st-Connectivity (Q3624373) (← links)
• Introducing Quasirandomness to Computer Science (Q3644716) (← links)
• (Q4643956) (← links)