- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Tile-Packing Tomography Is $\mathbbNP}$ -hard ; volume:64 ; number:2 ; day:19 ; month:2 ; year:2011 ; pages:267-278 ; date:10.2012
Algorithmica ; 64, Heft 2 (19.2.2011), 267-278, 10.2012
- Urheber
-
Chrobak, Marek
Dürr, Christoph
Guíñez, Flavio
Lozano, Antoni
Thang, Nguyen Kim
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-011-9498-1
- URN
-
urn:nbn:de:101:1-2019062221303192294216
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:54 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Chrobak, Marek
- Dürr, Christoph
- Guíñez, Flavio
- Lozano, Antoni
- Thang, Nguyen Kim
- SpringerLink (Online service)
Ähnliche Objekte (12)
Automating Resolution is NP-Hard
Pool resolution is NP-hard to recognize
Computing the Interleaving Distance is NP-Hard
Robust Geometric Programming is co-NP hard
NP-hard networking problems : exact and approximate algorithms
Leveraging Path Structures in NP-hard Graph Problems
Finite-size effects on the closest packing of hard spheres
Novel Machine Learning Algorithms for NP-hard Combinatorial Problems
Deadlock-Detection in Component-Based Systems is NP-hard.
De Bruijn Superwalk with Multiplicities Problem is NP-hard
Parameterized algorithms of fundamental NP-hard problems: a survey
Approximating good simultaneous diophantine approximations is almost NP-hard
Automating Resolution is NP-Hard
Pool resolution is NP-hard to recognize
Computing the Interleaving Distance is NP-Hard
Robust Geometric Programming is co-NP hard
NP-hard networking problems : exact and approximate algorithms
Leveraging Path Structures in NP-hard Graph Problems
Finite-size effects on the closest packing of hard spheres
Novel Machine Learning Algorithms for NP-hard Combinatorial Problems
Deadlock-Detection in Component-Based Systems is NP-hard.
De Bruijn Superwalk with Multiplicities Problem is NP-hard
Parameterized algorithms of fundamental NP-hard problems: a survey
Approximating good simultaneous diophantine approximations is almost NP-hard
Automating Resolution is NP-Hard
Pool resolution is NP-hard to recognize
Computing the Interleaving Distance is NP-Hard
Robust Geometric Programming is co-NP hard
NP-hard networking problems : exact and approximate algorithms
Leveraging Path Structures in NP-hard Graph Problems
Finite-size effects on the closest packing of hard spheres
Novel Machine Learning Algorithms for NP-hard Combinatorial Problems
Deadlock-Detection in Component-Based Systems is NP-hard.
De Bruijn Superwalk with Multiplicities Problem is NP-hard
Parameterized algorithms of fundamental NP-hard problems: a survey