Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion (Q3113772)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion |
scientific article |
Statements
23 January 2012
0 references
computational complexity
0 references
arithmetic circuits
0 references
hardness-randomness tradeoffs
0 references
identity testing
0 references
determinant versus permanent
0 references
Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion (English)
0 references
