Characterizing Propositional Proofs as Non-commutative Formulas
- Submitting institution
-
Royal Holloway and Bedford New College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 30091420
- Type
- D - Journal article
- DOI
-
10.1137/16M1107632
- Title of journal
- SIAM Journal on Computing
- Article number
- -
- First page
- 1424
- Volume
- 47
- Issue
- 4
- ISSN
- 0097-5397
- Open access status
- Access exception
- Month of publication
- July
- 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
-
2
- Research group(s)
-
-
- Citation count
- 3
- 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 provides a surprising characterisation of a basic object: it shows that every propositional proof is a disguised fast parallel noncommutative computation. While the question of which problems are solvable by fast parallel noncommutative computation is well understood, a similar question about instances with short propositional proofs is not. We provided thus a new insight into a fundamental hardness question (in the family of the P vs. NP questions). An extended abstract appeared in CCC and was invited to the special issue as one of the top papers.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -