Next:
Translating SAT Instances to
Visualisation of Satisfiability Problems using Connected Graphs
Andrew Slater
Translating SAT Instances to a Connected Graph
Some Simple Lossy Translations
Generating The Images
Some SAT Benchmarks Visualised as Graphs
2 Bit Adder
Inductive Interference
Pigeon Hole Problem
Parity Problem
A Synthetic Benchmark
Conclusions
Bibliography
About this document ...
Last modified: 2004-03-17
Andrew Slater
