| dc.contributor.author |
Ansótegui Gil, Carlos José |
| dc.contributor.author |
Béjar Torres, Ramón |
| dc.contributor.author |
Fernàndez Camon, César |
| dc.contributor.author |
Mateu Piñol, Carles |
| dc.date |
2016-07-05T11:03:19Z |
| dc.date |
2008 |
| dc.date |
10000-01-01 |
| dc.identifier |
0302-9743 |
| dc.identifier |
http://hdl.handle.net/10459.1/57360 |
| dc.identifier |
https://doi.org/10.1002/(SICI)1097-02110.1007/978-3-540-85958-1_20 |
| dc.identifier.uri |
http://hdl.handle.net/10459.1/57360 |
| dc.description |
In this paper we provide a new method to generate hard
k-SAT instances. Basically, we construct the bipartite incidence graph of
a k-SAT instance where the left side represents the clauses and the right
side represents the literals of our Boolean formula. Then, the clauses are
filled by incrementally connecting both sides while keeping the girth of
the graph as high as possible. That assures that the expansion of the
graph is also high. It has been shown that high expansion implies high
resolution width w. The resolution width characterizes the hardness of
an instance F of n variables since if every resolution refutation of F has
width w then every resolution refutation requires size 2Ω(w2/n)
. We have
extended this approach to generate hard n-ary CSP instances. Finally,
we have also adapted this idea to increase the expansion of the system
of linear equations used to generate XOR-SAT instances, being able to
produce harder satisfiable instances than former generators. |
| dc.description |
Research partially supported by projects TIN2006-15662-C02-02, TIN2007-68005-C04-02 and José Castillejo 2007 program funded by the Ministerio de Educación y Ciencia |
| dc.language |
eng |
| dc.publisher |
Springer Verlag |
| dc.relation |
MIECI/PN2004-2007/TIN2006-15662-C02-02 |
| dc.relation |
MIECI/PN2004-2007/TIN2007-68005-C04-02 |
| dc.relation |
Reproducció del document publicat a https://doi.org/10.1002/(SICI)1097-02110.1007/978-3-540-85958-1_20 |
| dc.relation |
Lecture Notes in Computer Science, 2008, vol. 5202, p. 298-312 |
| dc.rights |
(c) Springer-Verlag Berlin Heidelberg, 2008 |
| dc.rights |
info:eu-repo/semantics/restrictedAccess |
| dc.title |
From High Girth Graphs to Hard Instances |
| dc.type |
article |
| dc.type |
publishedVersion |
