Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound

Kol, Gillat; Moran, Shay; Shpilka, Amir; Yehudayoff, Amir

doi:10.1007/978-3-662-43948-7_58

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound

MPS-Authors

/persons/resource/persons118057

Moran, Shay
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Kol, G., Moran, S., Shpilka, A., & Yehudayoff, A. (2014). Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound. In J. Esparza, P. Fraigniaud, T. Husfeldt, & E. Koutsoupias (Eds.), Automata, Languages, and Programming (pp. 701-712). Berlin: Springer. doi:10.1007/978-3-662-43948-7_58.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0024-5A4C-A

Abstract

There is no abstract available