"Checking Unsatisfiability Proofs in Parallel."

Norbert Manthey, Tobias Philipp (2018)

> Home

Details and statistics

DOI: 10.29007/8W4V

access: open

type: Conference or Workshop Paper

metadata version: 2021-08-15

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/sat/MantheyP18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sat/MantheyP18
Norbert Manthey, Tobias Philipp:
Checking Unsatisfiability Proofs in Parallel. POS@SAT 2018: 34-49

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.