Pages that link to "Item:Q993423"

The following pages link to An explicit lower bound for the block complexity of an algebraic number (Q993423):

Displaying 3 items.

• Quantitative versions of the subspace theorem and applications (Q449689) (← links)
• A further improvement of the quantitative subspace theorem (Q1947638) (← links)
• On the computational complexity of algebraic numbers: the Hartmanis–Stearns problem revisited (Q4960229) (← links)