All NP-problems can be solved in polynomial time by...

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

Florin Manea, Victor Mitrana
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
103
Year:
2007
Language:
english
Pages:
7
DOI:
10.1016/j.ipl.2007.03.001
File:
PDF, 145 KB
english, 2007
Conversion to is in progress
Conversion to is failed