Search Results - MSC 68Q25 Analysis of algorithms and problem complexity

  • Showing 1 - 3 results of 3
Refine Results
  1. 1
    Cover Image

    Low rank matrix completion by alternating steepest descent methods by Tanner, Jared, Wei, Ke

    ISSN: 1063-5203, 1096-603X
    Published: Elsevier Inc 01.03.2016
    “… In this paper, we introduce an alternating steepest descent algorithm (ASD) and a scaled variant, ScaledASD, for the fixed-rank matrix completion problem…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  2. 2
    Cover Image

    On complexity, representation and approximation of integral multicommodity flows by Srivastav, Anand, Stangier, Peter

    ISSN: 0166-218X, 1872-6771
    Published: Lausanne Elsevier B.V 01.02.2000
    Published in Discrete Applied Mathematics (01.02.2000)
    “…) where m is the number of constraints (resp. the number of edges). In the complexity-theoretic part it is shown that the approximable instances above build hard problems…”
    Get full text
    Journal Article Conference Proceeding
    Save to List
    Saved in:
  3. 3
    Cover Image

    The most nonelementary theory by Vorobyov, Sergei

    ISSN: 0890-5401, 1090-2651
    Published: San Diego, CA Elsevier Inc 01.05.2004
    Published in Information and computation (01.05.2004)
    “…))=2 height 2 cm for some constant c>0, where n denotes the length of input. This gives the highest currently known lower bound for a decidable logical theory and affirmatively settles Problem 10.13…”
    Get full text
    Journal Article
    Save to List
    Saved in:

Search Tools: