ECCC
Electronic Colloquium on Computational Complexity
Login | Register | Classic Style



REPORTS > KEYWORD > MATRIX COMPLETION:
Reports tagged with Matrix completion:
TR09-008 | 15th January 2009
Stasys Jukna, Georg Schnitger

Min-Rank Conjecture for Log-Depth Circuits

A completion of an m-by-n matrix A with entries in {0,1,*} is obtained by setting all *-entries to constants 0 or 1. A system of semi-linear equations over GF(2) has the form Mx=f(x), where M is a completion of A and f:{0,1}^n --> {0,1}^m is an operator, the i-th coordinate ... more >>>



ISSN 1433-8092 | Imprint