Uniform, integral and efficient proofs for the determinant identities
- Submitting institution
-
Royal Holloway and Bedford New College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 28967388
- Type
- E - Conference contribution
- DOI
-
10.1109/LICS.2017.8005099
- Title of conference / published proceedings
- 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
- First page
- 1
- Volume
- -
- Issue
- -
- ISSN
- -
- Open access status
- -
- Month of publication
- August
- Year of publication
- 2017
- 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
-
1
- Research group(s)
-
-
- Citation count
- -
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This collaboration with Stephen Cook solves a basic open problem in Bounded Arithmetic, posed by Cook himself (inventor of NP-completeness; Turing Award 1982). Extended abstract appeared in the flagship conference LICS, and invited for the top overall CS journal: Journal of the ACM [accepted; in print]. The work provided the essentially weakest possible formal theory in which basic statements of linear algebra are provable. It also exemplified new application of ideas from algebraic complexity in the seemingly unrelated area of weak formal theories of arithmetic. This work contributes to the understanding of feasible mathematics and the meta-mathematics of complexity.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -