Pages that link to "Item:Q4326850"
From MaRDI portal
The following pages link to Matrix Transformation Is Complete for the Average Case (Q4326850):
Displaying 13 items.
- A Random NP-complete problem for inversion of 2D cellular automata (Q672376) (← links)
- On complete one-way functions (Q734307) (← 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)
- Complete distributional problems, hard languages, and resource-bounded measure (Q1575682) (← links)
- All \(\operatorname{SL}_{2}\)-tilings come from infinite triangulations (Q2362591) (← links)
- Public-key cryptography and invariant theory (Q2577586) (← links)
- Algebraic cryptography: new constructions and their security against provable break (Q3079281) (← links)
- Generalized Learning Problems and Applications to Non-commutative Cryptography (Q3092369) (← links)
- An Average Case NP-complete Graph Colouring Problem (Q4962593) (← links)
- Average-Case Completeness in Tag Systems (Q5090467) (← links)
- ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS (Q5401598) (← links)
- Rankable distributions do not provide harder instances than uniform distributions (Q6085735) (← links)
