External Links

    Journal: Electronic Colloquium on Computational Complexity (ECCC)

    Volume 10, Issue 022

    0 -- 0Piotr Berman, Marek Karpinski, Alex D. Scott. Approximation Hardness and Satisfiability of Bounded Occurrence Instances of SAT
    runs on