Pages that link to "Item:Q3142587"
From MaRDI portal
The following pages link to Randomizing Reductions of Search Problems (Q3142587):
Displaying 7 items.
- A Random NP-complete problem for inversion of 2D cellular automata (Q672376) (← links)
- On the complexity of deadlock detection in families of planar nets (Q1285587) (← links)
- No NP problems averaging over ranking of distributions are harder (Q1391309) (← links)
- Polynomial time samplable distributions (Q1578504) (← links)
- Complete on average Boolean satisfiability (Q1872642) (← links)
- The complexity of generating test instances (Q5048939) (← links)
- Rankable distributions do not provide harder instances than uniform distributions (Q6085735) (← links)
