scientific article; zbMATH DE number 1746037

MaRDI QIDQ4531985zbMATH OpenFDO

Authors George Kapoulas

Publication date 27 May 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2064/20640101

Mathematics Subject Classification ID

Algebraic number theory computations (11Y40) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• Computational complexity over the \(p\)-adic numbers
• Polynomial computability of fields of algebraic numbers
• Fields of algebraic numbers computable in polynomial time. I
• Computing \(p\)-adic \(L\)-functions of totally real number fields
• Fields of algebraic numbers computable in polynomial time. II
• Polynomial-time presentations of algebraic number fields
• scientific article; zbMATH DE number 4134023
• scientific article; zbMATH DE number 2086908
• On upper bounds of the complexity of functions over nonprime finite fields in some classes of polarized polynomials
• An algorithmic characterization of polynomial functions over \(\mathbb Z_{p^n}\)

Cited in

(4)

• Computing power series in polynomial time
• Characterizing polynomial time complexity of stream programs using interpretations
• Characterizing polynomial time computability of rational and real functions
• An algorithmic characterization of polynomial functions over \(\mathbb Z_{p^n}\)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4531985)