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!
|