The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies. Gopalan, P., Kolaitis, P. G., Maneva, E. N., & Papadimitriou, C. H. SIAM Journal on Computing, 38(6):2330–2355, 2009. doi bibtex @article{journals/siamcomp/GopalanKMP09,
title = {{The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies}},
author = {Parikshit Gopalan and Phokion G. Kolaitis and Elitza N. Maneva and Christos H. Papadimitriou},
year = {2009},
journal = {SIAM Journal on Computing},
volume = {38},
number = {6},
pages = {2330--2355},
doi = {10.1137/07070440x},
archiveprefix = {arXiv},
eprint = {cs/0609072}
}
Downloads: 0
{"_id":"3JhXjcB3EBqLyYXFj","bibbaseid":"gopalan-kolaitis-maneva-papadimitriou-theconnectivityofbooleansatisfiabilitycomputationalandstructuraldichotomies-2009","downloads":0,"creationDate":"2018-04-26T15:50:51.272Z","title":"The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies","author_short":["Gopalan, P.","Kolaitis, P. G.","Maneva, E. N.","Papadimitriou, C. H."],"year":2009,"bibtype":"article","biburl":"http://reconf.wdfiles.com/local--files/papers/core-pubs.bib","bibdata":{"bibtype":"article","type":"article","title":"The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies","author":[{"firstnames":["Parikshit"],"propositions":[],"lastnames":["Gopalan"],"suffixes":[]},{"firstnames":["Phokion","G."],"propositions":[],"lastnames":["Kolaitis"],"suffixes":[]},{"firstnames":["Elitza","N."],"propositions":[],"lastnames":["Maneva"],"suffixes":[]},{"firstnames":["Christos","H."],"propositions":[],"lastnames":["Papadimitriou"],"suffixes":[]}],"year":"2009","journal":"SIAM Journal on Computing","volume":"38","number":"6","pages":"2330–2355","doi":"10.1137/07070440x","archiveprefix":"arXiv","eprint":"cs/0609072","bibtex":"@article{journals/siamcomp/GopalanKMP09,\n\ttitle = {{The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies}},\n\tauthor = {Parikshit Gopalan and Phokion G. Kolaitis and Elitza N. Maneva and Christos H. Papadimitriou},\n\tyear = {2009},\n\tjournal = {SIAM Journal on Computing},\n\tvolume = {38},\n\tnumber = {6},\n\tpages = {2330--2355},\n\tdoi = {10.1137/07070440x},\n\tarchiveprefix = {arXiv},\n\teprint = {cs/0609072}\n}\n","author_short":["Gopalan, P.","Kolaitis, P. G.","Maneva, E. N.","Papadimitriou, C. H."],"key":"journals/siamcomp/GopalanKMP09","id":"journals/siamcomp/GopalanKMP09","bibbaseid":"gopalan-kolaitis-maneva-papadimitriou-theconnectivityofbooleansatisfiabilitycomputationalandstructuraldichotomies-2009","role":"author","urls":{},"metadata":{"authorlinks":{}},"downloads":0,"html":""},"search_terms":["connectivity","boolean","satisfiability","computational","structural","dichotomies","gopalan","kolaitis","maneva","papadimitriou"],"keywords":[],"authorIDs":[],"dataSources":["R9eXboc378MwrE3Tw","jNG3wK2WHaPhF8w3T","WAuJLwywKRHbCMAEF"]}