Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion
From MaRDI portal
Publication:3113772
DOI10.4230/LIPICS.STACS.2010.2477zbMath1230.68093OpenAlexW2963177092MaRDI QIDQ3113772
Publication date: 23 January 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_4dfa.html
computational complexityarithmetic circuitsidentity testingdeterminant versus permanenthardness-randomness tradeoffs
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
This page was built for publication: Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion