Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures

Andreas Goerdt, Tomasz Jurdzinski. Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures. In Krzysztof Diks, Wojciech Rytter, editors, Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings. Volume 2420 of Lecture Notes in Computer Science, pages 280-291, Springer, 2002. [doi]

@inproceedings{GoerdtJ02,
  title = {Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures},
  author = {Andreas Goerdt and Tomasz Jurdzinski},
  year = {2002},
  url = {http://link.springer.de/link/service/series/0558/bibs/2420/24200280.htm},
  researchr = {https://researchr.org/publication/GoerdtJ02},
  cites = {0},
  citedby = {0},
  pages = {280-291},
  booktitle = {Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
  editor = {Krzysztof Diks and Wojciech Rytter},
  volume = {2420},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-44040-2},
}