The previous content of this pahe is moved to Talk:Complexity class of problems solvable in logarithmic space and polynomial time with probabilistic Turing mach
| This disambiguation page does not require a rating on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||
| ||||||||
The 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)
Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.