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

Florin Manea, Victor Mitrana (2007)

> Home

Details and statistics

DOI: 10.1016/J.IPL.2007.03.001

access: closed

type: Journal Article

metadata version: 2024-10-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/ManeaM07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/ManeaM07
Florin Manea, Victor Mitrana:
All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size. Inf. Process. Lett. 103(3): 112-118 (2007)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.