Stephen Foster
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Using clausal graphs to determine the computational complexity of \(k\)-bounded positive one-in-three SAT Discrete Applied Mathematics | 2009-06-30 | Paper |
Research outcomes over time
This page was built for person: Stephen Foster
