Suchergebnisse - MSC 68Q25 Analysis of algorithms and problem complexity
-
1
Low rank matrix completion by alternating steepest descent methods
ISSN: 1063-5203, 1096-603XVeröffentlicht: Elsevier Inc 01.03.2016Veröffentlicht in Applied and computational harmonic analysis (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 …”
Volltext
Journal Article -
2
On complexity, representation and approximation of integral multicommodity flows
ISSN: 0166-218X, 1872-6771Veröffentlicht: Lausanne Elsevier B.V 01.02.2000Veröffentlicht 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 …”
Volltext
Journal Article Tagungsbericht -
3
The most nonelementary theory
ISSN: 0890-5401, 1090-2651Veröffentlicht: San Diego, CA Elsevier Inc 01.05.2004Veröffentlicht 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 …”
Volltext
Journal Article