The following pages link to The cost of computing integers (Q4875601):
Displayed 4 items.
- On solving univariate sparse polynomials in logarithmic time (Q1763426) (← links)
- On the intractability of Hilbert's Nullstellensatz and an algebraic version of ``\(NP\neq P\)?'' (Q1913573) (← links)
- On a generalization of addition chains: addition-multiplication chains (Q2467743) (← links)
- On asymptotic estimates for arithmetic cost functions (Q4332956) (← links)