# Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion

* Corresponding author
Abstract : In (Kabanets, Impagliazzo, 2004) it is shown how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit multilinear polynomial family for arithmetical circuits. In this paper, a special case of CPIT is considered, namely low-degree non-singular matrix completion (NSMC). For this subclass of problems it is shown how to obtain the same deterministic time bound, using a weaker assumption in terms of determinantal complexity. Hardness-randomness tradeoffs will also be shown in the converse direction, in an effort to make progress on Valiant's VP versus VNP problem. To separate VP and VNP, it is known to be sufficient to prove that the determinantal complexity of the m-by-m permanent is $m^{\omega(\log m)}$. In this paper it is shown, for an appropriate notion of explicitness, that the existence of an explicit multilinear polynomial family with determinantal complexity m^{\omega(\log m)}$is equivalent to the existence of an efficiently computable generator$G_n$for multilinear NSMC with seed length$O(n^{1/\sqrt{\log n}})$. The latter is a combinatorial object that provides an efficient deterministic black-box algorithm for NSMC. Multilinear NSMC'' indicates that$G_n$only has to work for matrices$M(x)$of$poly(n)$size in$n$variables, for which$det(M(x))\$ is a multilinear polynomial.
Keywords :
Document type :
Conference papers
Jean-Yves Marion and Thomas Schwentick. 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Mar 2010, Nancy, France. pp.465-476, 2010, Proceedings of the 27th Annual Symposium on the Theoretical Aspects of Computer Science

Cited literature [14 references]

https://hal.inria.fr/inria-00455738
Contributor : Publications Loria <>
Submitted on : Thursday, February 11, 2010 - 9:42:59 AM
Last modification on : Thursday, February 11, 2010 - 9:57:15 AM
Document(s) archivé(s) le : Friday, June 18, 2010 - 8:08:33 PM

### File

Jansen09final.pdf
Files produced by the author(s)

### Identifiers

• HAL Id : inria-00455738, version 1

### Citation

Maurice Jansen. Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion. Jean-Yves Marion and Thomas Schwentick. 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Mar 2010, Nancy, France. pp.465-476, 2010, Proceedings of the 27th Annual Symposium on the Theoretical Aspects of Computer Science. 〈inria-00455738〉

Record views