Matthew Gwynne
Title
Cited by
Cited by
Year
Generalising unit-refutation completeness and SLUR via nested input resolution
M Gwynne, O Kullmann
Arxiv preprint arXiv:1204.6529, 2012
262012
Generalising and unifying SLUR and unit-refutation completeness
M Gwynne, O Kullmann
International Conference on Current Trends in Theory and Practice of …, 2013
252013
On SAT representations of XOR constraints
M Gwynne, O Kullmann
International Conference on Language and Automata Theory and Applications …, 2014
192014
Towards a theory of good SAT representations
M Gwynne, O Kullmann
arXiv preprint arXiv:1302.4421, 2013
122013
Trading inference effort versus size in CNF knowledge compilation
M Gwynne, O Kullmann
arXiv preprint arXiv:1310.5746, 2013
112013
Towards a better understanding of hardness
M Gwynne, O Kullmann
The Seventeenth International Conference on Principles and Practice of …, 2011
112011
A framework for good SAT translations, with applications to CNF representations of XOR constraints
M Gwynne, O Kullmann
arXiv preprint arXiv:1406.7398, 2014
52014
Attacking aes via sat
M Gwynne, O Kullmann
BSc Dissertation (Swansea), 2010
32010
Advanced encryption standard ii benchmarks
M Gwynne, O Kullmann
SAT CHALLENGE 2012, 74, 2012
12012
The Interaction between Propositional Satisfiability and Applications in Cryptography and Ramsey Problems
M Gwinne
Swansea University, 2010
12010
Hierarchies for efficient clausal entailment checking: With applications to satisfiability and knowledge compilation
M Gwynne
PQDT-Global, 2014
2014
Towards a better understanding of representing problems as SAT problems
M Gwynne, O Kullmann
The system can't perform the operation now. Try again later.
Articles 1–12