BIROn - Birkbeck Institutional Research Online
    Up a level
    Export as [feed] Atom [feed] RSS
    Jump to: Book Section
    Number of items: 1.

    Book Section

    Johannsen, D. and Razgon, Igor and Wahlström, M. (2009) Solving SAT for CNF formulas with a one-sided restriction on variable occurrences. In: Kullmann, O. (ed.) Theory and Applications of Satisfiability Testing. Lecture Notes in Computer Science 5584. Berlin, Germany: Springer Verlag, pp. 80-85. ISBN 9783642027765.

    This list was generated on Sun May 19 03:30:55 2019 BST.