Special Issue on Algorithms and Complexity

Algorithmic complexity is concerned about how fast or slow particular algorithm performs. There is great progress and opportunity in nonclassical computational technologies and algorithmics. These include exploiting novel computational aspects of physical phenomena, using nonclassical algorithms, or using classical algorithmics in a nonclassical manner. Key issues are feasibility of technology, efficiency of algorithms, and theoretical basics. The goal of this special issue is to provide a platform for scientists and academicians all over the world to promote, share, and discuss various new issues and developments in the area of algorithms and complexity.

In this special issue, we invite front-line researchers and authors to submit original research and review articles that explore algorithms and complexity. In this special issue, potential topics include, but are not limited to:

• Fast factoring
• Square-root unordered search
• Distributed networking, security
• Bio-informatics algorithmics
• Automatic learning by compression
• Algorithm analysis
• Algorithm design

Authors should read over the journal’s For Authors carefully before submission. Prospective authors should submit an electronic copy of their complete manuscript through the journal’s Paper Submission System.

Please kindly specify the “Special Issue” under your manuscript title. The research field “Special Issue - Algorithms and Complexity” should be selected during your submission.

Special Issue timetable:

Guest Editor:

For further questions or inquiries

Please contact Editorial Assistant at

apm@scirp.org