An Encoding Invariant Version of Polynomial Time Computable Distributions

DOI10.1007/978-3-642-13182-0_37zbMATH Open1285.68050OpenAlexW1798002591MaRDI QIDQ3569762

Nikolai K. Vereshchagin

Publication date: 22 June 2010

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13182-0_37

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

This page was built for publication: An Encoding Invariant Version of Polynomial Time Computable Distributions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569762)