"All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of ..."

Florin Manea, Carlos Martín-Vide, Victor Mitrana (2006)

> Home

Details and statistics

DOI: 10.1007/11925903_4

access: closed

type: Conference or Workshop Paper

metadata version: 2024-10-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/dna/ManeaMM06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dna/ManeaMM06
Florin Manea, Carlos Martín-Vide, Victor Mitrana:
All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size. DNA 2006: 47-57

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.