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

DOI10.1155/2013/893045zbMATH Open1276.39012OpenAlexW2043239429WikidataQ58917681 ScholiaQ58917681MaRDI QIDQ370288FDOQ370288

Authors: Yi-Chou Chen, Hang-Chin Lai 

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

Recommendations

• scientific article
• 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.

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Near solutions of polynomial equations
• Title not available (Why is that?)
• Factoring Multivariate Polynomials over Algebraic Number Fields
• Approximate solutions of polynomial equations.
• Algorithms for near solutions to polynomial equations

Cited In (8)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Infinitely many eigenfunctions for polynomial problems: exact results
• 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 quasi-coincidence point solutions of multivariate polynomial problems

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)