๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

[ACM Press the 44th symposium - New York, New York, USA (2012.05.19-2012.05.22)] Proceedings of the 44th symposium on Theory of Computing - STOC '12 - Complexity of counting CSP with complex weights

โœ Scribed by Cai, Jin-Yi; Chen, Xi


Book ID
118036386
Publisher
ACM Press
Year
2012
Tongue
English
Weight
647 KB
Category
Article
ISBN
1450312454

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


[ACM Press the 44th symposium - New York
โœ Arora, Sanjeev; Ge, Rong; Kannan, Ravindran; Moitra, Ankur ๐Ÿ“‚ Article ๐Ÿ“… 2012 ๐Ÿ› ACM Press ๐ŸŒ English โš– 858 KB

The Nonnegative Matrix Factorization (NMF) problem has a rich history spanning quantum mechanics, probability theory, data analysis, polyhedral combinatorics, communication complexity, demography, chemometrics, etc. In the past decade NMF has become enormously popular in machine learning, where the