Resource-bounded measure on probabilistic classes
From MaRDI portal
Publication:963376
DOI10.1016/j.ipl.2007.11.019zbMath1186.68206MaRDI QIDQ963376
Publication date: 19 April 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://eprints.maynoothuniversity.ie/3501/1/PM_Measure.pdf
computational complexity; randomized algorithms; probabilistic complexity classes; resource-bounded measure
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
Cites Work