Pages that link to "Item:Q967421"
From MaRDI portal
The following pages link to On the approximability of the simplified partial digest problem (Q967421):
Displaying 7 items.
- The simplified partial digest problem: approximation and a graph-theoretic model (Q621677) (← links)
- Partial digest is hard to solve for erroneous input data (Q817811) (← links)
- A fast and simple partially oblivious PRF, with applications (Q2170066) (← links)
- A new dynamic programming algorithm for the simplified partial digest problem (Q2697542) (← links)
- Combinatorial optimization in DNA mapping — a computational thread of the Simplified Partial Digest Problem (Q5439390) (← links)
- LATIN 2004: Theoretical Informatics (Q5901658) (← links)
- Breaking SIDH in polynomial time (Q6083675) (← links)