| Generalising unit-refutation completeness and SLUR via nested input resolution M Gwynne, O Kullmann Arxiv preprint arXiv:1204.6529, 2012 | 21 | 2012 |
| On SAT representations of XOR constraints M Gwynne, O Kullmann International Conference on Language and Automata Theory and Applications …, 2014 | 20 | 2014 |
| Generalising and unifying SLUR and unit-refutation completeness M Gwynne, O Kullmann International Conference on Current Trends in Theory and Practice of …, 2013 | 19 | 2013 |
| Towards a theory of good SAT representations M Gwynne, O Kullmann arXiv preprint arXiv:1302.4421, 2013 | 10 | 2013 |
| Trading inference effort versus size in CNF knowledge compilation M Gwynne, O Kullmann arXiv preprint arXiv:1310.5746, 2013 | 9 | 2013 |
| Attacking aes via sat M Gwynne, K Oliver BSc Dissertation (Swansea), 2010 | 8 | 2010 |
| Towards a better understanding of hardness M Gwynne, O Kullmann The Seventeenth International Conference on Principles and Practice of …, 2011 | 7 | 2011 |
| A framework for good SAT translations, with applications to CNF representations of XOR constraints M Gwynne, O Kullmann arXiv preprint arXiv:1406.7398, 2014 | 3 | 2014 |
| Hierarchies for efficient clausal entailment checking: With applications to satisfiability and knowledge compilation. M Gwynne Swansea University, 2013 | 1 | 2013 |
| Advanced encryption standard ii benchmarks M Gwynne, O Kullmann SAT CHALLENGE 2012, 74, 2012 | 1 | 2012 |
| The Interaction between Propositional Satisfiability and Applications in Cryptography and Ramsey Problems M Gwinne Swansea University, 2010 | 1 | 2010 |
| Towards a better understanding of representing problems as SAT problems M Gwynne, O Kullmann | | |
Oliver KullmannSwansea UniversityVerified email at Swansea.ac.uk
Oliver KullmannSwansea UniversityVerified email at Swansea.ac.uk