The Complexity of Malign Measures

DOI10.1137/0222012MaRDI QIDQ4037690zbMATH OpenOpenAlexFDO

Authors Peter Bro Miltersen

Publication date 16 May 1993

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0222012

zbMATH Keywords

average case complexitymalignness

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Transformations that preserve malignness of universal distributions
• Complexity of distributions and average-case hardness
• Malign distributions for average case circuit complexity
• On the theory of average case complexity
• Malign distributions for average case circuit complexity.

Cited in

(8)

• Some properties of sets tractable under every polynomial-time computable distribution
• An average complexity measure that yields tight hierarchies
• Transformations that preserve malignness of universal distributions
• Polynomial time samplable distributions
• Computational depth: Concept and applications
• Average-case analysis via incompressibility
• Transformations that preserve malignness of universal distributions
• Generalized juntas and NP-hard sets

This page was built for publication: The Complexity of Malign Measures

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