مرکز منطقه ای اطلاع رساني علوم و فناوري - All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size

Title of article :

All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size

Author/Authors :

Florin Manea، نويسنده , , Victor Mitrana، نويسنده ,

Issue Information :

دوهفته نامه با شماره پیاپی سال 2007

Pages :

From page :

112

To page :

118

Keywords :

Turing machine , formal languages , Theory of computation , NP-language , Evolutionary processor

Journal title :

Information Processing Letters

Serial Year :

2007

Journal title :

Information Processing Letters

Record number :

130460

Link To Document :