Resolution and the binary encoding of combinatorial principles
- Submitting institution
-
University of Durham
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 122737
- Type
- E - Conference contribution
- DOI
-
10.4230/LIPIcs.CCC.2019.6
- Title of conference / published proceedings
- Computational Complexity Conference
- First page
- 6:1
- Volume
- -
- Issue
- -
- ISSN
- 18688969
- Open access status
- Compliant
- Month of publication
- -
- Year of publication
- 2019
- URL
-
https://doi.org/10.4230/LIPIcs.CCC.2019.6
- 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)
-
B - Algorithms and Complexity
- Citation count
- 0
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- At the conceptual level, this was the first paper that formally argued for the benefits of studying the binary encoding in Proof Complexity. At the technical level, the main contribution was a new technique for proving lower bounds for resolution with bounded conjunction that yielded a better result than the only known earlier method. This line of research has extended into a PhD project and resulted in a follow-up paper: Dantchev, S., Ghani, A., and Martin, B., Sherali-Adams and the binary encoding of combinatorial principles, LATIN 2020.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -