GLORIA

GEOMAR Library Ocean Research Information Access

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Online Resource
    Online Resource
    Society for Industrial & Applied Mathematics (SIAM) ; 2022
    In:  SIAM Journal on Discrete Mathematics Vol. 36, No. 3 ( 2022-09), p. 1955-1990
    In: SIAM Journal on Discrete Mathematics, Society for Industrial & Applied Mathematics (SIAM), Vol. 36, No. 3 ( 2022-09), p. 1955-1990
    Type of Medium: Online Resource
    ISSN: 0895-4801 , 1095-7146
    RVK:
    Language: English
    Publisher: Society for Industrial & Applied Mathematics (SIAM)
    Publication Date: 2022
    detail.hit.zdb_id: 1468404-4
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 2
    Online Resource
    Online Resource
    Association for Computing Machinery (ACM) ; 2019
    In:  ACM Transactions on Computation Theory Vol. 11, No. 4 ( 2019-12-31), p. 1-26
    In: ACM Transactions on Computation Theory, Association for Computing Machinery (ACM), Vol. 11, No. 4 ( 2019-12-31), p. 1-26
    Abstract: This article analyzes to what extent it is possible to efficiently reduce the number of clauses in NP-hard satisfiability problems without changing the answer. Upper and lower bounds are established using the concept of kernelization. Existing results show that if NP ⊈ coNP/poly, no efficient preprocessing algorithm can reduce n -variable instances of cnf-sat with  d literals per clause to equivalent instances with  O ( n d −ε ) bits for any ε 〉 0. For the N ot -A ll -E qual sat problem, a compression to size  Õ ( n d −1 ) exists. We put these results in a common framework by analyzing the compressibility of CSPs with a binary domain. We characterize constraint types based on the minimum degree of multivariate polynomials whose roots correspond to the satisfying assignments, obtaining (nearly) matching upper and lower bounds in several settings. Our lower bounds show that not just the number of constraints, but also the encoding size of individual constraints plays an important role. For example, for E xact S atisfiability with unbounded clause length it is possible to efficiently reduce the number of constraints to  n +1, yet no polynomial-time algorithm can reduce to an equivalent instance with  O ( n 2−ε ) bits for any  ε 〉 0, unless NP ⊆ coNP/poly.
    Type of Medium: Online Resource
    ISSN: 1942-3454 , 1942-3462
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 2019
    detail.hit.zdb_id: 2488065-6
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 3
    Online Resource
    Online Resource
    Association for Computing Machinery (ACM) ; 2023
    In:  ACM Transactions on Computation Theory
    In: ACM Transactions on Computation Theory, Association for Computing Machinery (ACM)
    Abstract: We investigate the List H -Coloring problem, the generalization of graph coloring that asks whether an input graph  G admits a homomorphism to the undirected graph  H (possibly with loops), such that each vertex  v ∈ V ( G ) is mapped to a vertex on its list  L ( v )⊆ V ( H ). An important result by Feder, Hell, and Huang [JGT 2003] states that List H -Coloring is polynomial-time solvable if  H is a so-called bi-arc graph , and NP-complete otherwise. We investigate the NP-complete cases of the problem from the perspective of polynomial-time sparsification: can an n -vertex instance be efficiently reduced to an equivalent instance of bitsize  \(\mathcal {O}(n^{2-\varepsilon }) \) for some ε 〉 0? We prove that if  H is not a bi-arc graph, then List H -Coloring does not admit such a sparsification algorithm unless \({\mathsf {NP \subseteq coNP/poly}} \) . Our proofs combine techniques from kernelization lower bounds with a study of the structure of graphs  H which are not bi- graphs.
    Type of Medium: Online Resource
    ISSN: 1942-3454 , 1942-3462
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 2023
    detail.hit.zdb_id: 2488065-6
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 4
    Online Resource
    Online Resource
    Springer Science and Business Media LLC ; 2019
    In:  Algorithmica Vol. 81, No. 10 ( 2019-10), p. 3865-3889
    In: Algorithmica, Springer Science and Business Media LLC, Vol. 81, No. 10 ( 2019-10), p. 3865-3889
    Type of Medium: Online Resource
    ISSN: 0178-4617 , 1432-0541
    Language: English
    Publisher: Springer Science and Business Media LLC
    Publication Date: 2019
    detail.hit.zdb_id: 1458414-1
    detail.hit.zdb_id: 53958-2
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 5
    Online Resource
    Online Resource
    Elsevier BV ; 2020
    In:  Theoretical Computer Science Vol. 841 ( 2020-11), p. 124-166
    In: Theoretical Computer Science, Elsevier BV, Vol. 841 ( 2020-11), p. 124-166
    Type of Medium: Online Resource
    ISSN: 0304-3975
    RVK:
    Language: English
    Publisher: Elsevier BV
    Publication Date: 2020
    detail.hit.zdb_id: 193706-6
    detail.hit.zdb_id: 1466347-8
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 6
    In: Circulation, Ovid Technologies (Wolters Kluwer Health), Vol. 144, No. 23 ( 2021-12-07), p. 1845-1855
    Abstract: Despite advances in surgery and pharmacotherapy, there remains significant residual ischemic risk after coronary artery bypass grafting surgery. Methods: In REDUCE-IT (Reduction of Cardiovascular Events With Icosapent Ethyl–Intervention Trial), a multicenter, placebo-controlled, double-blind trial, statin-treated patients with controlled low-density lipoprotein cholesterol and mild to moderate hypertriglyceridemia were randomized to 4 g daily of icosapent ethyl or placebo. They experienced a 25% reduction in risk of a primary efficacy end point (composite of cardiovascular death, myocardial infarction, stroke, coronary revascularization, or hospitalization for unstable angina) and a 26% reduction in risk of a key secondary efficacy end point (composite of cardiovascular death, myocardial infarction, or stroke) when compared with placebo. The current analysis reports on the subgroup of patients from the trial with a history of coronary artery bypass grafting. Results: Of the 8179 patients randomized in REDUCE-IT, a total of 1837 (22.5%) had a history of coronary artery bypass grafting, with 897 patients randomized to icosapent ethyl and 940 to placebo. Baseline characteristics were similar between treatment groups. Randomization to icosapent ethyl was associated with a significant reduction in the primary end point (hazard ratio [HR], 0.76 [95% CI, 0.63–0.92] ; P =0.004), in the key secondary end point (HR, 0.69 [95% CI, 0.56–0.87]; P =0.001), and in total (first plus subsequent or recurrent) ischemic events (rate ratio, 0.64 [95% CI, 0.50–0.81]; P =0.0002) compared with placebo. This yielded an absolute risk reduction of 6.2% (95% CI, 2.3%–10.2%) in first events, with a number needed to treat of 16 (95% CI, 10–44) during a median follow-up time of 4.8 years. Safety findings were similar to the overall study: beyond an increased rate of atrial fibrillation/flutter requiring hospitalization for at least 24 hours (5.0% vs 3.1%; P =0.03) and a nonsignificant increase in bleeding, occurrences of adverse events were comparable between groups. Conclusions: In REDUCE-IT patients with a history of coronary artery bypass grafting, treatment with icosapent ethyl was associated with significant reductions in first and recurrent ischemic events. Registration: URL: https://www.clinicaltrials.gov ; Unique identifier: NCT01492361.
    Type of Medium: Online Resource
    ISSN: 0009-7322 , 1524-4539
    Language: English
    Publisher: Ovid Technologies (Wolters Kluwer Health)
    Publication Date: 2021
    detail.hit.zdb_id: 1466401-X
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 7
    Online Resource
    Online Resource
    Springer Science and Business Media LLC ; 2017
    In:  Algorithmica Vol. 79, No. 1 ( 2017-9), p. 3-28
    In: Algorithmica, Springer Science and Business Media LLC, Vol. 79, No. 1 ( 2017-9), p. 3-28
    Type of Medium: Online Resource
    ISSN: 0178-4617 , 1432-0541
    Language: English
    Publisher: Springer Science and Business Media LLC
    Publication Date: 2017
    detail.hit.zdb_id: 1458414-1
    detail.hit.zdb_id: 53958-2
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 8
    Online Resource
    Online Resource
    Springer Science and Business Media LLC ; 2020
    In:  Algorithmica Vol. 82, No. 8 ( 2020-08), p. 2200-2242
    In: Algorithmica, Springer Science and Business Media LLC, Vol. 82, No. 8 ( 2020-08), p. 2200-2242
    Type of Medium: Online Resource
    ISSN: 0178-4617 , 1432-0541
    Language: English
    Publisher: Springer Science and Business Media LLC
    Publication Date: 2020
    detail.hit.zdb_id: 1458414-1
    detail.hit.zdb_id: 53958-2
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 9
    Online Resource
    Online Resource
    Springer Science and Business Media LLC ; 2021
    In:  Theory of Computing Systems Vol. 65, No. 5 ( 2021-07), p. 884-900
    In: Theory of Computing Systems, Springer Science and Business Media LLC, Vol. 65, No. 5 ( 2021-07), p. 884-900
    Abstract: We discuss a game theoretic variant of the subset sum problem, in which two players compete for a common resource represented by a knapsack. Each player owns a private set of items, players pack items alternately, and each player either wants to maximize the total weight of his own items packed into the knapsack or to minimize the total weight of the items of the other player. We show that finding the best packing strategy against a hostile or a selfish adversary is PSPACE-complete, and that against these adversaries the optimal reachable item weight for a player cannot be approximated within any constant factor (unless P=NP). The game becomes easier when the adversary is short-sighted and plays greedily: finding the best packing strategy against a greedy adversary is NP-complete in the weak sense. This variant forms one of the rare examples of pseudo-polynomially solvable problems that have a PTAS, but do not allow an FPTAS (unless P=NP).
    Type of Medium: Online Resource
    ISSN: 1432-4350 , 1433-0490
    Language: English
    Publisher: Springer Science and Business Media LLC
    Publication Date: 2021
    detail.hit.zdb_id: 1463181-7
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 10
    In: Arthritis & Rheumatology, Wiley, Vol. 68, No. 2 ( 2016-02), p. 462-472
    Abstract: Circulating chromatin‐containing apoptotic material and/or neutrophil extracellular traps (NETs) have been proposed to be an important driving force for the antichromatin autoimmune response in patients with systemic lupus erythematosus (SLE). The aim of this study was to determine the exact nature of microparticles in the circulation of SLE patients and to assess the effects of the microparticles on the immune system. Methods We analyzed microparticles isolated from the plasma of patients with SLE, rheumatoid arthritis (RA), and systemic sclerosis (SSc), as well as from healthy subjects. The effects of the microparticles on blood‐derived dendritic cells (DCs) and neutrophils were assessed by flow cytometry, enzyme‐linked immunosorbent assay, and immunofluorescence microscopy. Results In SLE patients, we identified microparticles that were highly positive for annexin V and apoptosis‐modified chromatin that were not present in healthy subjects or in RA or SSc patients. These microparticles were mostly CD31+/CD45– (endothelial), partly CD45+/CD66b+ (granulocyte), and negative for B and T cell markers. Microparticles isolated from the plasma of SLE patients increased the expression of the costimulatory surface molecules CD40, CD80, CD83, and CD86 and the production of proinflammatory cytokines interleukin‐6, tumor necrosis factor, and interferon‐α by blood‐derived plasmacytoid DCs (PDCs) and myeloid DCs (MDCs). SLE microparticles also primed blood‐derived neutrophils for NETosis. Microparticles from healthy subjects and from RA or SSc patients exhibited no significant effects on MDCs, PDCs, and NETosis. Conclusion Circulating microparticles in SLE patients include a population of apoptotic cell–derived microparticles that has proinflammatory effects on PDCs and MDCs and enhances NETosis. These results underline the important role of apoptotic microparticles in driving the autoimmune response in SLE patients.
    Type of Medium: Online Resource
    ISSN: 2326-5191 , 2326-5205
    URL: Issue
    RVK:
    RVK:
    Language: English
    Publisher: Wiley
    Publication Date: 2016
    detail.hit.zdb_id: 2754614-7
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...