"Proof Complexity for the Maximum Satisfiability Problem and its Use in SAT ..."

Emma Rollon, Javier Larrosa (2022)

> Home

Details and statistics

DOI: 10.1093/LOGCOM/EXAC004

access: closed

type: Journal Article

metadata version: 2022-11-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/logcom/RollonL22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/logcom/RollonL22
Emma Rollon, Javier Larrosa:
Proof Complexity for the Maximum Satisfiability Problem and its Use in SAT Refutations. J. Log. Comput. 32(7): 1401-1435 (2022)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.