Approximation Hardness and Satisfiability of Bounded Occurrence Instances of SAT

@article{Berman2003ApproximationHA,
  title={Approximation Hardness and Satisfiability of Bounded Occurrence Instances of SAT},
  author={Piotr Berman and Marek Karpinski and Alex D. Scott},
  journal={Electronic Colloquium on Computational Complexity (ECCC)},
  year={2003},
  volume={10}
}

From This Paper

Topics from this paper.

Similar Papers

Loading similar papers…