- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1471-2105
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
De Bruijn Superwalk with Multiplicities Problem is NP-hard ; volume:14 ; number:5 ; day:10 ; month:4 ; year:2013 ; pages:1-4 ; date:4.2013
BMC bioinformatics ; 14, Heft 5 (10.4.2013), 1-4, 4.2013
- Creator
-
Kapun, Evgeny
- Contributor
-
Tsarev, Fedor
SpringerLink (Online service)
- DOI
-
10.1186/1471-2105-14-S5-S7
- URN
-
urn:nbn:de:1111-2016021743920
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
11.08.2025, 10:40 PM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Kapun, Evgeny
- Tsarev, Fedor
- SpringerLink (Online service)
Other Objects (12)
Automating Resolution is NP-Hard
Pool resolution is NP-hard to recognize
Computing the Interleaving Distance is NP-Hard
Tile-Packing Tomography Is $\mathbbNP}$ -hard
Robust Geometric Programming is co-NP hard
NP-hard networking problems : exact and approximate algorithms
Leveraging Path Structures in NP-hard Graph Problems
Deadlock-Detection in Component-Based Systems is NP-hard.
Deciding Liveness in Component-Based Systems is NP-hard
Approximating good simultaneous diophantine approximations is almost NP-hard
Novel Machine Learning Algorithms for NP-hard Combinatorial Problems
Parameterized algorithms of fundamental NP-hard problems: a survey
Automating Resolution is NP-Hard
Pool resolution is NP-hard to recognize
Computing the Interleaving Distance is NP-Hard
Tile-Packing Tomography Is $\mathbbNP}$ -hard
Robust Geometric Programming is co-NP hard
NP-hard networking problems : exact and approximate algorithms
Leveraging Path Structures in NP-hard Graph Problems
Deadlock-Detection in Component-Based Systems is NP-hard.
Deciding Liveness in Component-Based Systems is NP-hard
Approximating good simultaneous diophantine approximations is almost NP-hard
Novel Machine Learning Algorithms for NP-hard Combinatorial Problems
Parameterized algorithms of fundamental NP-hard problems: a survey
Automating Resolution is NP-Hard
Pool resolution is NP-hard to recognize
Computing the Interleaving Distance is NP-Hard
Tile-Packing Tomography Is $\mathbbNP}$ -hard
Robust Geometric Programming is co-NP hard
NP-hard networking problems : exact and approximate algorithms
Leveraging Path Structures in NP-hard Graph Problems
Deadlock-Detection in Component-Based Systems is NP-hard.
Deciding Liveness in Component-Based Systems is NP-hard
Approximating good simultaneous diophantine approximations is almost NP-hard
Novel Machine Learning Algorithms for NP-hard Combinatorial Problems