The following pages link to Markus Hittmeir (Q2023316):
Displaying 13 items.
- Integer factoring and compositeness witnesses (Q2023317) (← links)
- A deterministic algorithm for finding \(r\)-power divisors (Q2093686) (← links)
- Integer factorization as subset-sum problem (Q2700674) (← links)
- A babystep-giantstep method for faster deterministic integer factorization (Q3177725) (← links)
- Computational aspects of rational residuosity (Q4609564) (← links)
- A time-space tradeoff for Lehman’s deterministic integer factorization method (Q4992239) (← links)
- A log-log speedup for exponent one-fifth deterministic integer factorisation (Q5070544) (← links)
- Deterministic Integer Factorization with Oracles for Euler’s Totient Function (Q5131778) (← links)
- Deterministic factorization of sums and differences of powers (Q5270841) (← links)
- A Reduction of Integer Factorization to Modular Tetration (Q5859627) (← links)
- Integer factorization as subset-sum problem (Q6399692) (← links)
- Smooth Subsum Search: A heuristic for practical integer factorization (Q6424357) (← links)
- Smooth subsum search a heuristic for practical integer factorization (Q6660954) (← links)
