On Solving Big Mazes Using Small Space: Revision history

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

13 June 2024

  • curprev 23:0223:02, 13 June 2024‎ Vivek talk contribs‎ 857 bytes +857‎ Created page with "Solving mazes is a computational problem appearing in a wide range of situations - starting from puzzles, social networks and system verification applications. The fundamental abstraction of this problem is the graph reachability problem which asks if given a graph G and two special vertices s and t, is t reachable from s or not? The question of whether or not this problem can be solved using space that is logarithmic in the number of vertices, encapsulates the centre st..."
Retrieved from ‘https://wiki.fosscell.org/index.php?title=On_Solving_Big_Mazes_Using_Small_Space’