Randomized NP-completeness for p -adic rational roots of sparse polynomials in one variable

DOI10.1145/1837934.1837997zbMath1321.68279OpenAlexW2000083597MaRDI QIDQ2946560

No author found.

Publication date: 17 September 2015

Published in: Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1837934.1837997

zbMATH Keywords

arithmetic progressionfeasibilitysparse\(p\)-adicNP

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Other nonanalytic theory (11S85)

Related Items (1)

Solvability of cubic equations in \(p\)-adic integers \((p>3)\)

Uses Software

• DIFFALG
• AIDA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Differential algebra for derivations with nontrivial commutation rules
• Generating differential invariants
• Projective-type differential invariants and geometric curve evolutions of KdV-type in flat homogeneous manifolds
• Smooth and algebraic invariants of a group action: Local and global constructions
• Differential invariants of a Lie group action: syzygies on a generating set
• Invariants différentiels d'un pseudogroupe de Lie. I
• Invariants différentiels d'un pseudogroupe de Lie. II
• Higher order contact of submanifolds of homogeneous spaces
• Moving coframes. II: Regularization and theoretical foundations
• Rational invariants of a group action. Construction and rewriting
• Differential invariants of conformal and projective surfaces

This page was built for publication: Randomized NP-completeness for p -adic rational roots of sparse polynomials in one variable