The following pages link to Average case completeness (Q1176231):
Displaying 13 items.
- A complete one-way function based on a finite rank free \(\mathbb{Z}\times\mathbb{Z}\)-module (Q376132) (← links)
- An approach to estimating the average-case complexity of postoptimality analysis of discrete optimization problems (Q464980) (← links)
- Average-case intractability vs. worst-case intractability (Q598182) (← links)
- Reducibility classes of P-selective sets (Q672155) (← links)
- A Random NP-complete problem for inversion of 2D cellular automata (Q672376) (← links)
- On complete one-way functions (Q734307) (← links)
- Generic case completeness (Q736607) (← links)
- The complexity of generating test instances (Q5048939) (← links)
- Average-Case Completeness in Tag Systems (Q5090467) (← links)
- Nonexistence of minimal pairs for generic computability (Q5300075) (← links)
- Sets computable in polynomial time on average (Q6085734) (← links)
- Rankable distributions do not provide harder instances than uniform distributions (Q6085735) (← links)
- Structure in average case complexity (Q6487946) (← links)
