On the Exact Complexity of Evaluating Quantified ::::k::::-CNF

Chris Calabro, Russell Impagliazzo, Ramamohan Paturi. On the Exact Complexity of Evaluating Quantified ::::k::::-CNF. In Venkatesh Raman, Saket Saurabh, editors, Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings. Volume 6478 of Lecture Notes in Computer Science, pages 50-59, Springer, 2010. [doi]

@inproceedings{CalabroIP10,
  title = {On the Exact Complexity of Evaluating Quantified ::::k::::-CNF},
  author = {Chris Calabro and Russell Impagliazzo and Ramamohan Paturi},
  year = {2010},
  doi = {10.1007/978-3-642-17493-3_7},
  url = {http://dx.doi.org/10.1007/978-3-642-17493-3_7},
  researchr = {https://researchr.org/publication/CalabroIP10},
  cites = {0},
  citedby = {0},
  pages = {50-59},
  booktitle = {Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings},
  editor = {Venkatesh Raman and Saket Saurabh},
  volume = {6478},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-17492-6},
}