Pages that link to "Item:Q1198047"
From MaRDI portal
The following pages link to Average case complexity under the universal distribution equals worst- case complexity (Q1198047):
Displaying 14 items.
- Generalized juntas and NP-hard sets (Q837194) (← links)
- The miraculous universal distribution (Q1272403) (← links)
- Some properties of sets tractable under every polynomial-time computable distribution (Q1350351) (← links)
- Transformations that preserve malignness of universal distributions (Q1391313) (← links)
- Average-case analysis of algorithms using Kolmogorov complexity (Q1587331) (← links)
- Malign distributions for average case circuit complexity. (Q1854270) (← links)
- Computational depth: Concept and applications (Q2368976) (← links)
- How robust are average complexity measures? A statistical case study (Q2383700) (← links)
- $$P\mathop{ =}\limits^{?}NP$$ (Q2826803) (← links)
- Malign distributions for average case circuit complexity (Q4596659) (← links)
- Average-case analysis via incompressibility (Q5055919) (← links)
- (Q5140842) (← links)
- Rankable distributions do not provide harder instances than uniform distributions (Q6085735) (← links)
- Transformations that preserve malignness of universal distributions (Q6085736) (← links)
