"Solving 3-Satisfiability in Less Then 1, 579n Steps."

Ingo Schiermeyer (1992)
a service of Schloss Dagstuhl - Leibniz Center for Informatics