A Non-NP-Complete Algorithm for a Quasi-Fixed Polynomial Problem
Let be a real-valued polynomial function of the form , with degree of in An irreducible real-valued polynomial function and a nonnegative integer are given to find a polynomial function satisfying the following expression: for some constant . The constant is dependent on the solution , namel...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2013-01-01
|
| Series: | Abstract and Applied Analysis |
| Online Access: | http://dx.doi.org/10.1155/2013/893045 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849403778196832256 |
|---|---|
| author | Yi-Chou Chen Hang-Chin Lai |
| author_facet | Yi-Chou Chen Hang-Chin Lai |
| author_sort | Yi-Chou Chen |
| collection | DOAJ |
| description | Let be a real-valued polynomial function of the form , with degree of in An irreducible real-valued polynomial function and a nonnegative integer are given to find a polynomial function satisfying the following expression: for some constant . The constant is dependent on the solution , namely, a quasi-fixed (polynomial) solution of the polynomial-like equation . In this paper, we will provide a non-NP-complete algorithm to solve all quasi-fixed solutions if the equation has only a finite number of quasi-fixed solutions. |
| format | Article |
| id | doaj-art-83b84700e8de4a1c98d6080e95fc7745 |
| institution | Kabale University |
| issn | 1085-3375 1687-0409 |
| language | English |
| publishDate | 2013-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Abstract and Applied Analysis |
| spelling | doaj-art-83b84700e8de4a1c98d6080e95fc77452025-08-20T03:37:11ZengWileyAbstract and Applied Analysis1085-33751687-04092013-01-01201310.1155/2013/893045893045A Non-NP-Complete Algorithm for a Quasi-Fixed Polynomial ProblemYi-Chou Chen0Hang-Chin Lai1Department of General Education, National Army Academy, Taoyuan 320, TaiwanDepartment of Mathematics, National Tsing Hua University, Hsinchu 300, TaiwanLet be a real-valued polynomial function of the form , with degree of in An irreducible real-valued polynomial function and a nonnegative integer are given to find a polynomial function satisfying the following expression: for some constant . The constant is dependent on the solution , namely, a quasi-fixed (polynomial) solution of the polynomial-like equation . In this paper, we will provide a non-NP-complete algorithm to solve all quasi-fixed solutions if the equation has only a finite number of quasi-fixed solutions.http://dx.doi.org/10.1155/2013/893045 |
| spellingShingle | Yi-Chou Chen Hang-Chin Lai A Non-NP-Complete Algorithm for a Quasi-Fixed Polynomial Problem Abstract and Applied Analysis |
| title | A Non-NP-Complete Algorithm for a Quasi-Fixed Polynomial Problem |
| title_full | A Non-NP-Complete Algorithm for a Quasi-Fixed Polynomial Problem |
| title_fullStr | A Non-NP-Complete Algorithm for a Quasi-Fixed Polynomial Problem |
| title_full_unstemmed | A Non-NP-Complete Algorithm for a Quasi-Fixed Polynomial Problem |
| title_short | A Non-NP-Complete Algorithm for a Quasi-Fixed Polynomial Problem |
| title_sort | non np complete algorithm for a quasi fixed polynomial problem |
| url | http://dx.doi.org/10.1155/2013/893045 |
| work_keys_str_mv | AT yichouchen anonnpcompletealgorithmforaquasifixedpolynomialproblem AT hangchinlai anonnpcompletealgorithmforaquasifixedpolynomialproblem AT yichouchen nonnpcompletealgorithmforaquasifixedpolynomialproblem AT hangchinlai nonnpcompletealgorithmforaquasifixedpolynomialproblem |