Short Proofs for the Determinant Identities
- Submitting institution
-
Royal Holloway and Bedford New College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 26426040
- Type
- D - Journal article
- DOI
-
10.1137/130917788
- Title of journal
- SIAM Journal on Computing
- Article number
- -
- First page
- 340
- Volume
- 44
- Issue
- 2
- ISSN
- 0097-5397
- Open access status
- Out of scope for open access requirements
- Month of publication
- April
- Year of publication
- 2015
- 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
- 6
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Published in the top journal in the theory of computing, this work resolved a long-standing open problem, establishing short propositional proofs for the multiplicativity of the determinant. This has consequences to the ability to separate different proof systems as well as providing a new synergy between the two separate fields of algebraic- and proof-complexity. Considered a breakthrough in the field, this work was picked up by Stephen Cook (Turing Award, 1982) leading to a solution of another long-standing open problem (see 2 above). Have implications to complexity theory, feasible mathematics and satisfiability.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -