Pages that link to "Item:Q2051782"
From MaRDI portal
The following pages link to Computing absolutely normal numbers in nearly linear time (Q2051782):
Displaying 9 items.
- A polynomial-time algorithm for computing absolutely normal numbers (Q386000) (← links)
- Turing's unpublished algorithm for normal numbers (Q884468) (← links)
- Normal Numbers and Computer Science (Q4613551) (← links)
- Algorithmic Fractal Dimensions in Geometric Measure Theory (Q5024574) (← links)
- Quadratic-Time Algorithms for Normal Elements (Q5121105) (← links)
- M. Levin’s construction of absolutely normal numbers with very low discrepancy (Q5270840) (← links)
- A computable absolutely normal Liouville number (Q5501153) (← links)
- An example of a computable absolutely normal number (Q5958342) (← links)
- Finding normal binary floating-point factors efficiently (Q6156639) (← links)