- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
A Tight Lower Bound for Planar Steiner Orientation ; volume:81 ; number:8 ; day:4 ; month:5 ; year:2019 ; pages:3200-3216 ; date:8.2019
Algorithmica ; 81, Heft 8 (4.5.2019), 3200-3216, 8.2019
- Urheber
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-019-00580-x
- URN
-
urn:nbn:de:101:1-2019092503061250950606
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:23 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
- Chitnis, Rajesh
- Feldmann, Andreas Emil
- Suchý, Ondřej
- SpringerLink (Online service)
Ähnliche Objekte (12)
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence
A tight lower bound for semi-synchronous collaborative grid exploration
A tight lower bound for semi-synchronous collaborative grid exploration
An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
Tight upper and lower bounds for the reciprocal sum of Proth primes
Tight lower bounds and optimal constructions of anonymous broadcast encryption and authentication
Planar Steiner Orientation is NP-complete
Upper and Lower Tight Error Bounds for Feature Omission with an Extension to Context Reduction
Tight lower bound of consecutive lengths for QC-LDPC codes with girth at least ten
Almost tight lower bounds on regular resolution refutations of Tseitin Formulas for all constant-degree graphs
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence
A tight lower bound for semi-synchronous collaborative grid exploration
A tight lower bound for semi-synchronous collaborative grid exploration
An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
Tight upper and lower bounds for the reciprocal sum of Proth primes
Tight lower bounds and optimal constructions of anonymous broadcast encryption and authentication
Planar Steiner Orientation is NP-complete
Upper and Lower Tight Error Bounds for Feature Omission with an Extension to Context Reduction
Tight lower bound of consecutive lengths for QC-LDPC codes with girth at least ten
Almost tight lower bounds on regular resolution refutations of Tseitin Formulas for all constant-degree graphs
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence
A tight lower bound for semi-synchronous collaborative grid exploration
A tight lower bound for semi-synchronous collaborative grid exploration
An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
Tight upper and lower bounds for the reciprocal sum of Proth primes
Tight lower bounds and optimal constructions of anonymous broadcast encryption and authentication
Planar Steiner Orientation is NP-complete
Upper and Lower Tight Error Bounds for Feature Omission with an Extension to Context Reduction
Tight lower bound of consecutive lengths for QC-LDPC codes with girth at least ten