Proving SAT does not have Small Circuits with an Application to the Two Queries Problem. Fortnow, L., Pavan, A., & Sengupta, S. Journal of Computer and System Sciences, 74(3):358-363, May, 2008. Special issue for selected papers from the 18th IEEE Conference on Computational Complexity
Proving SAT does not have Small Circuits with an Application to the Two Queries Problem [link]Paper  Proving SAT does not have Small Circuits with an Application to the Two Queries Problem [pdf]Paper  doi  bibtex   
@article{satcirc-J,
show = 1,
title = "Proving {SAT} does not have Small Circuits with
an Application to the Two Queries Problem",
author = "L. Fortnow and A. Pavan and S. Sengupta",
journal = jcss,
year = 2008,
month = may,
volume = 74,
number = 3,
pages = "358-363",
url = "https://dx.doi.org/10.1016/j.jcss.2007.06.017",
doi = "10.1016/j.jcss.2007.06.017",
note = "Special issue for selected papers from the 18th IEEE
Conference on Computational Complexity",
url_Paper = "https://lance.fortnow.com/papers/files/2q.pdf"}
Downloads: 0