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

DOI10.1155/2013/893045MaRDI QIDQ370288zbMATH OpenOpenAlexWikidataFDO

Authors Yi-Chou Chen, Hang-Chin Lai

Publication date 19 September 2013

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

Copyright license Creative Commons Attribution 3.0 Unported

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)

Recommendations

• scientific article; zbMATH DE number 5706765
• Quasi-fixed polynomial solutions of real-valued polynomial equation
• scientific article; zbMATH DE number 6025194
• New quasi-coincidence point polynomial problems
• Approximate solutions of polynomial equations.

Cites work

• scientific article; zbMATH DE number 5706765 (Why is no real title available?)
• scientific article; zbMATH DE number 1936673 (Why is no real title available?)
• Algorithms for near solutions to polynomial equations
• Approximate solutions of polynomial equations.
• Factoring Multivariate Polynomials over Algebraic Number Fields
• Near solutions of polynomial equations

Cited in

(8)

• Infinitely many quasi-coincidence point solutions of multivariate polynomial problems
• A polynomial-time algorithm for computing the yolk in fixed dimension
• Quasi-fixed polynomial solutions of real-valued polynomial equation
• New quasi-coincidence point polynomial problems
• A Non-2-step Nilsystem With Linear Polynomial Complexity
• Infinitely many eigenfunctions for polynomial problems: exact results
• scientific article; zbMATH DE number 5706765 (Why is no real title available?)
• scientific article; zbMATH DE number 6025194 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q370288)