On the encoding invariance of polynomial time computable distribution ensembles

DOI10.1007/978-3-642-38536-0_17zbMATH Open1381.68100OpenAlexW29049470MaRDI QIDQ4928484FDOQ4928484

Authors: Anton Makhlin 

Publication date: 14 June 2013

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-38536-0_17

Recommendations

• An encoding invariant version of polynomial time computable distributions
• scientific article; zbMATH DE number 1114051
• Encoding invariance in average case complexity
• Polynomial time samplable distributions
• scientific article; zbMATH DE number 1301087

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited In (1)

• An encoding invariant version of polynomial time computable distributions

This page was built for publication: On the encoding invariance of polynomial time computable distribution ensembles

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