A non-NP-complete algorithm for a quasi-fixed polynomial problem

DOI10.1155/2013/893045zbMath1276.39012OpenAlexW2043239429WikidataQ58917681 ScholiaQ58917681MaRDI QIDQ370288

Hang-Chin Lai, Yi-Chou Chen

Publication date: 19 September 2013

Published in: Abstract and Applied Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/893045

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Functional equations for real functions (39B22) Real and complex fields (12D99)

Related Items (2)

Infinitely many eigenfunctions for polynomial problems: exact results ⋮ Infinitely many quasi-coincidence point solutions of multivariate polynomial problems

Cites Work

• Unnamed Item
• Unnamed Item
• Algorithms for near solutions to polynomial equations
• Approximate solutions of polynomial equations.
• Near solutions of polynomial equations
• Factoring Multivariate Polynomials over Algebraic Number Fields

This page was built for publication: A non-NP-complete algorithm for a quasi-fixed polynomial problem