Generalized Matrix Completion and Algebraic Natural Proofs
- Submitting institution
-
The University of Liverpool
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 12165
- Type
- E - Conference contribution
- DOI
-
10.1145/3188745.3188832
- Title of conference / published proceedings
- STOC'18: PROCEEDINGS OF THE 50TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING
- First page
- 1193
- Volume
- -
- Issue
- -
- ISSN
- 0737-8017
- Open access status
- Technical exception
- Month of publication
- June
- Year of publication
- 2018
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
3
- Research group(s)
-
-
- Citation count
- 2
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This article provides a setting in which the algebraic natural proofs barrier is implied by a classical Boolean separation conjecture of complexity classes. Ikenmeyer and others already started to develop this approach further, for example in "On the Orbit Closure Containment Problem and Slice Rank of Tensors" (SODA 2021), not REF returned.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -