![]() | Disambiguation | |||
|
Untitled
editThe previous content of this pahe is moved to Talk:Complexity class of problems solvable in logarithmic space and polynomial time with probabilistic Turing machines
I doubt if the "complexity class.." should be referred as RLP in the disambig page. I did not find any confirmaition of sush an abbreviation; such a plansing of the content could be an error. I go to remove meaning "complexity class..". Any objections? dima (talk) 06:35, 13 July 2008 (UTC)
- I don't know where I originally ran across this usage, but I don't object to removing it in favour of RP. I certainly do object to removing it in favor of the current title. Dcoetzee 02:40, 14 July 2008 (UTC)