Chris Calabro, Russell Impagliazzo, Ramamohan Paturi,
"A Duality between Clause Width and Clause Density for SAT,"
Computational Complexity, Annual IEEE Conference on, pp. 252-260, 21st Annual IEEE Conference on Computational Complexity (CCC'06), 2006.
BibTex
x
@article{
10.1109/CCC.2006.6, author = {Chris Calabro and Russell Impagliazzo and Ramamohan Paturi}, title = {A Duality between Clause Width and Clause Density for SAT}, journal ={Computational Complexity, Annual IEEE Conference on}, volume = {0}, year = {2006}, issn = {1093-0159}, pages = {252-260}, doi = {http://doi.ieeecomputersociety.org/10.1109/CCC.2006.6}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }
RefWorks Procite/RefMan/Endnote
x
TY - CONF JO - Computational Complexity, Annual IEEE Conference on TI - A Duality between Clause Width and Clause Density for SAT SN - 1093-0159 SP252 EP260 A1 - Chris Calabro, A1 - Russell Impagliazzo, A1 - Ramamohan Paturi, PY - 2006 KW - null VL - 0 JA - Computational Complexity, Annual IEEE Conference on ER -
Chris Calabro, University of California, San Diego, USA
Chris Calabro, Russell Impagliazzo, Ramamohan Paturi, "A Duality between Clause Width and Clause Density for SAT," ccc, pp.252-260, 21st Annual IEEE Conference on Computational Complexity (CCC'06), 2006
PURCHASE ARTICLE: $19
IEEE Xplore Subscribers
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb