A note on sparse solutions of sparse linear systems
- 期刊名称Theoretical Computer Science
- 作者Yuan, Chen; Kan, Haibin
- 卷第552卷
- 印刷ISSN0304-3975
- 文件大小176.43KB
- 发表时间2014-10
- DOI10.1016/j.tcs.2014.07.029
- 页码109-111
Holographic reduction for some counting problemsChen Yuan; Haibin Kan · 2011
Smaller Bound of SuperconcentratorYUAN, Chen; KAN, Haibin · IEICE Transactions on Information and Systems · 2012
A construction method of matroidal networksChen Yuan, HaiBin Kan, Xin Wang, Hideki Imai · 2012
A novel elementary construction of matching vectorsChen Yuan; Qian Guo; Haibin Kan · 2012
Explicit-form complex orthogonal design for space-time block codesYuan Li, Chen Yuan, HaiBin Kan · 2013
A characterization of solvability for a class of networksChen Yuan; HaiBin Kan · 2012
The maximal rates and minimal decoding delay of more general complex orthogonal designsYuan Li; HaiBin Kan; Chen Yuan; HuanFei Ma · 2010
P automata revisitedPăun, Gheorghe; Pérez-Jiménez, Mario J. · Theoretical Computer Science · 2012
Consistency of multidimensional combinatorial substitutionsJolivet, Timo; Kari, Jarkko · Theoretical Computer Science · 2012
Quantum counterfeit coin problemsIwama, Kazuo; Nishimura, Harumichi; Raymond, Rudy; Teruyama, Junichi · Theoretical Computer Science · 2012
Reversible iterative graph processesDourado, Mitre C.; Penso, Lucia Draque; Rautenbach, Dieter; Szwarcfiter, Jayme L. · Theoretical Computer Science · 2012
Lowness for bounded randomnessDowney, Rod; Ng, Keng Meng · Theoretical Computer Science · 2012
Lower bound for balanced setsNedev, Zhivko · Theoretical Computer Science · 2012
The lattice structure of -player gamesCincotti, Alessandro · Theoretical Computer Science · 2012
Chordal digraphsMeister, Daniel; Telle, Jan Arne · Theoretical Computer Science · 2012