- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
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
- Creator
-
Chrobak, Marek
Dürr, Christoph
Guíñez, Flavio
Lozano, Antoni
Thang, Nguyen Kim
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-011-9498-1
- URN
-
urn:nbn:de:101:1-2019062221303192294216
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:54 AM 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
- Chrobak, Marek
- Dürr, Christoph
- Guíñez, Flavio
- Lozano, Antoni
- Thang, Nguyen Kim
- 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
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