What are the compelling reasons for believing $L\neq P$? L is the class of log-space algorithms with pointers to the input.Suppose L=P for the moment. What would a log-space algorithm for a P-complete problem look like in its general outlines?
What are the compelling reasons for believing $L\neq P$?
cc.complexity theory;complexity classes