scientific article; zbMATH DE number 819105

MaRDI QIDQ4855947zbMATH OpenFDO

Authors John Watrous

Publication date 3 September 1996

zbMATH Keywords

algorithmsArtin-Whaples approximation theorem

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Artin-Whaples approximations of bounded degree in algebraic varieties
• Approximation theorems for spaces of localities
• Fields of algebraic numbers computable in polynomial time. I
• Computing the decomposition of primes p and p-adic absolute values in semi-simple algebras over \({\mathbb{Q}}\)
• Algorithms for near solutions to polynomial equations

Cited in

(3)

• A streamlined proof of Goodwillie's n-excisive approximation
• On the asymptotic behaviour of the Aragón Artacho-Campoy algorithm
• A polynomial-time algorithm for computing the yolk in fixed dimension

Describes a project that uses

Uses Software

• Maple

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