Journal article 1469 views
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference
Herbert Fleischner,
Oliver Kullmann 
,
Stefan Szeider
,
Stefan Szeider
Theoretical Computer Science, Volume: 289, Issue: 1, Start page: 503
Swansea University Author:
Oliver Kullmann
Full text not available from this repository: check for access using links below.
DOI (Published version): 10.1016/S0304-3975(01)00337-1
Abstract
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference
| Published in: | Theoretical Computer Science |
|---|---|
| ISSN: | 0304-3975 |
| Published: |
2002
|
| Online Access: |
Check full text
|
| URI: | https://cronfa.swan.ac.uk/Record/cronfa1716 |
| College: |
Faculty of Science and Engineering |
|---|---|
| Issue: |
1 |
| Start Page: |
503 |