- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0665
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Pool resolution is NP-hard to recognize ; volume:48 ; number:8 ; day:24 ; month:9 ; year:2009 ; pages:793-798 ; date:12.2009
Archive for mathematical logic ; 48, Heft 8 (24.9.2009), 793-798, 12.2009
- Urheber
-
Buss, Samuel R.
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00153-009-0152-4
- URN
-
urn:nbn:de:101:1-2023051122391583694601
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 11:01 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
- Buss, Samuel R.
- SpringerLink (Online service)
Ähnliche Objekte (12)
Automating Resolution is NP-Hard
Tile-Packing Tomography Is $\mathbbNP}$ -hard
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
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
Deciding Liveness in Component-Based Systems is NP-hard
Automating Resolution is NP-Hard
Tile-Packing Tomography Is $\mathbbNP}$ -hard
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
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
Deciding Liveness in Component-Based Systems is NP-hard
Automating Resolution is NP-Hard
Tile-Packing Tomography Is $\mathbbNP}$ -hard
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
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