An encoding invariant version of polynomial time computable distributions

DOI10.1007/978-3-642-13182-0_37MaRDI QIDQ3569762zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Encoding invariance in average case complexity
• On the encoding invariance of polynomial time computable distribution ensembles
• On the theory of average case complexity
• All natural NP-complete problems have average-case complete versions
• Complexity of distributions and average-case hardness

Cited in

(2)

• Encoding invariance in average case complexity
• On the encoding invariance of polynomial time computable distribution ensembles

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)