scientific article; zbMATH DE number 953031

MaRDI QIDQ4717952zbMATH OpenFDO

Authors Michael Maller, Jennifer Whitehead

Publication date 17 February 1997

zbMATH Keywords

2-adic numberscomputational complexity

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Symbolic computation and algebraic computation (68W30)

Recommendations

• Computational complexity over the \(p\)-adic numbers
• 2-Adic Complexity of Binary m-Sequences
• A New Method to Compute the 2-Adic Complexity of Binary Sequences
• 2-adic complexity of two classes of generalized cyclotomic binary sequences
• On the 2-Adic Complexity of the Two-Prime Generator
• Complexity of computation in finite fields
• Algorithmic Number Theory
• On two notions of complexity of algebraic numbers
• The complexity of two problems on arithmetic circuits
• Publication:3197949

Cited in

(4)

• Computational complexity over the \(p\)-adic numbers
• Efficient \(p\)-adic cell decompositions for univariate polynomials
• P\(\neq\) NC over the \(p\)-adic numbers
• On invariance of degree for certain computations

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 Q4717952)