Probabilistic Store Reachability.
possibly: store each state with probability n/K where n is the number of states in line not saved and K is a parameter
However, this is probably harder with graph memory.
possibly: store each state with probability n/K where n is the number of states in line not saved and K is a parameter
However, this is probably harder with graph memory.