Sciweavers

539 search results - page 5 / 108
» An Improved Upper Bound for SAT
Sort
View
COMPGEOM
2008
ACM
15 years 1 months ago
Improved upper bounds on the crossing number
Vida Dujmovic, Ken-ichi Kawarabayashi, Bojan Mohar...
IPL
2008
53views more  IPL 2008»
14 years 11 months ago
A Note on "An improved upper bound on the queuenumber of the hypercube"
Kung-Jui Pai, Jou-Ming Chang, Yue-Li Wang
TCS
2010
14 years 10 months ago
Improved upper bounds for vertex cover
Jianer Chen, Iyad A. Kanj, Ge Xia
JSAT
2006
94views more  JSAT 2006»
14 years 11 months ago
A Note on the Use of Independent Sets for the k-SAT Problem
An independent set of variables is one in which no two variables occur in the same clause in a given k-SAT instance. Recently, independent sets have obtained more attention. Due t...
Konstantin Kutzkov
ESA
2009
Springer
107views Algorithms» more  ESA 2009»
15 years 6 months ago
Disproof of the Neighborhood Conjecture with Implications to SAT
We study a special class of binary trees. Our results have implications on Maker/Breaker games and SAT: We disprove a conjecture of Beck on positional games and construct an unsati...
Heidi Gebauer