The following pages link to The extended \(k\)-tree algorithm (Q431783):
Displaying 12 items.
- The extended \(k\)-tree algorithm (Q431783) (← links)
- Asymptotic results for the number of Wagner's solutions to a generalised birthday problem (Q900974) (← links)
- Quantum algorithms for the \(k\)-XOR problem (Q1633472) (← links)
- Improved combinatorial algorithms for the inhomogeneous short integer solution problem (Q1715853) (← links)
- An algorithmic framework for the generalized birthday problem (Q1999907) (← links)
- Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model (Q2119006) (← links)
- Optimal merging in quantum \(k\)-xor and \(k\)-sum algorithms (Q2119016) (← links)
- Computational aspects of retrieving a representation of an algebraic geometry code (Q2437321) (← links)
- Constructing Carmichael numbers through improved subset-product algorithms (Q2871190) (← links)
- Really Fast Syndrome-Based Hashing (Q3011909) (← links)
- Statistical Decoding of Codes over $\mathbb{F}_q$ (Q3102793) (← links)
- Time-Memory Tradeoffs for Large-Weight Syndrome Decoding in Ternary Codes (Q5087252) (← links)
