Binary refinement implies discrete exponentiation
From MaRDI portal
Recommendations
- Exact exponent in the remainder term of Gelfond's digit theorem in the binary case
- Binary cascades iterative refinement in doubled-mantissa arithmetics
- The discrete logarithm problem for exponents of bounded height
- scientific article; zbMATH DE number 610980
- scientific article; zbMATH DE number 125911
- On the binary digits of a power
- On binary operations with finite external range
- Integer powers in binary
- Binary recurrences for which powers of two are discriminating moduli
Cites work
- scientific article; zbMATH DE number 3839951 (Why is no real title available?)
- scientific article; zbMATH DE number 4012604 (Why is no real title available?)
- scientific article; zbMATH DE number 3754682 (Why is no real title available?)
- Independence results around constructive ZF
- On constructing completions
- The shrinking principle and the axiom of choice
- ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
Cited in
(7)- The shrinking principle and the axiom of choice
- Are there enough injective sets?
- The Jacobson radical for an inconsistency predicate
- Problems, solutions, and completions
- The Hahn-Banach theorem by disjunction elimination
- Refinement is equivalent to fullness
- Exact exponent in the remainder term of Gelfond's digit theorem in the binary case
This page was built for publication: Binary refinement implies discrete exponentiation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q861570)
