BibTeX record conf/coco/CalabroIKP03

download as .bib file

@inproceedings{DBLP:conf/coco/CalabroIKP03,
  author       = {Chris Calabro and
                  Russell Impagliazzo and
                  Valentine Kabanets and
                  Ramamohan Paturi},
  title        = {The Complexity of Unique k-SAT: An Isolation Lemma for k-CNFs},
  booktitle    = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
                  2003), 7-10 July 2003, Aarhus, Denmark},
  pages        = {135},
  publisher    = {{IEEE} Computer Society},
  year         = {2003},
  url          = {https://doi.org/10.1109/CCC.2003.1214416},
  doi          = {10.1109/CCC.2003.1214416},
  timestamp    = {Tue, 07 May 2024 20:09:54 +0200},
  biburl       = {https://dblp.org/rec/conf/coco/CalabroIKP03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.