Sparse complex polynomials and polynomial reducibility
From MaRDI portal
Publication:1238601
DOI10.1016/S0022-0000(77)80013-5zbMath0359.65043OpenAlexW1977022731MaRDI QIDQ1238601
Publication date: 1977
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0022-0000(77)80013-5
Analysis of algorithms and problem complexity (68Q25) Numerical computation of solutions to single equations (65H05) Polynomials (irreducibility, etc.) (11R09) Turing machines and related notions (03D10) Algorithms in computer science (68W99)
Related Items
Complete divisibility problems for slowly utilized oracles, Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring, Bounded-degree factors of lacunary multivariate polynomials, A heuristic technique for decomposing multisets of non-negative integers according to the Minkowski sum, Detecting lacunary perfect powers and computing their roots, Computing the multilinear factors of lacunary polynomials without heights, Counting curves and their projections, Overdetermined systems of sparse polynomial equations, New NP-hard and NP-complete polynomial and integer divisibility problems
Cites Work
