Table of Contents Author Guidelines Submit a Manuscript
Abstract and Applied Analysis
Volume 2013 (2013), Article ID 893045, 10 pages
Research Article

A Non-NP-Complete Algorithm for a Quasi-Fixed Polynomial Problem

1Department of General Education, National Army Academy, Taoyuan 320, Taiwan
2Department of Mathematics, National Tsing Hua University, Hsinchu 300, Taiwan

Received 15 January 2013; Accepted 24 February 2013

Academic Editor: Jen-Chih Yao

Copyright © 2013 Yi-Chou Chen and Hang-Chin Lai. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

How to Cite this Article

Yi-Chou Chen and Hang-Chin Lai, “A Non-NP-Complete Algorithm for a Quasi-Fixed Polynomial Problem,” Abstract and Applied Analysis, vol. 2013, Article ID 893045, 10 pages, 2013. doi:10.1155/2013/893045