Computing sparse approximations deterministically
From MaRDI portal
Publication:1915603
DOI10.1016/0024-3795(94)00175-8zbMath0852.65043OpenAlexW1987138204WikidataQ127554611 ScholiaQ127554611MaRDI QIDQ1915603
Hanno Lefmann, Thomas Hofmeister
Publication date: 5 December 1996
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(94)00175-8
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Probabilistic construction of deterministic algorithms: approximating packing integer programs
- On sparse approximations to randomized strategies and convex combinations
- Simple strategies for large zero-sum games with applications to complexity theory
- Polynomial Threshold Functions, $AC^0 $ Functions, and Spectral Norms
- Explicit Constructions of Depth-2 Majority Circuits for Comparison and Addition
This page was built for publication: Computing sparse approximations deterministically
