Computing sparse approximations deterministically

Linear Algebra and Its Applications

Volumn 240, Issue , 1996, Pages 9-19

  Hofmeister, Thomas ^a   Lefmann, Hanno ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 30244437359     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/0024-3795(94)00175-8     Document Type: Article

References (7)

1. I. Althöfer, On sparse approximations to randomized strategies and convex combinations, Linear Algebra Appl. 199:339-355 (1994).
2. N. Alon and J. Bruck, Explicit constructions of depth-2 majority circuits for comparison and addition, SIAM J. Discrete Math. 7:1-8 (1994).
3. N. Alon and J. Spencer, The Probabilistic Method, Wiley, New York, 1992.
4. 0 functions and spectral norms, SIAM J. Comput. 21:33-42 (1992).
5. R. J. Lipton and N. E. Young, Simple strategies for large zero-sum games with applications to complexity theory, in Proceedings of the 26th Annual ACM Symposium on Theory of Computing, 1994, pp. 734-740.
6. P. Raghavan, Probabilistic construction of deterministic algorithms: approximating packing integer programs, J. Comput. System Sci. 37:130-143 (1988).
7. N. E. Young, Greedy algorithms by derandomizing unknown distributions, preprint, 1994.