The Combinatorics of Conflicts between Clauses
暂无分享,去创建一个
[1] R. Brualdi,et al. Combinatorial Matrix Theory: Some Special Graphs , 1991 .
[2] Oliver Kullmann,et al. Lean clause-sets: generalizations of minimally unsatisfiable clause-sets , 2003, Discret. Appl. Math..
[3] Oliver Kullmann,et al. On the conflict matrix of clause-sets , 2003 .
[4] Noga Alon,et al. Multicolored forests in bipartite decompositions of graphs , 1991, J. Comb. Theory, Ser. B.
[5] Allen Van Gelder,et al. A perspective on certain polynomial-time solvable classes of satisfiability , 2003, Discret. Appl. Math..
[6] David A. Gregory,et al. Biclique decompositions and Hermitian rank , 1999 .
[7] Douglas B. West,et al. Eigensharp graphs: decomposition into complete bipartite subgraphs , 1988 .
[8] Ping Zhang,et al. Starfree biclique decompositions of complete graphs , 1998 .
[9] J. H. Lint. {0,1,*} distance problems in combinatorics , 1985 .
[10] Stefan Szeider,et al. Minimal Unsatisfiable Formulas with Bounded Clause-Variable Difference are Fixed-Parameter Tractable , 2003, COCOON.
[11] Richard M. Wilson,et al. A course in combinatorics , 1992 .
[12] Steven Roman. Advanced Linear Algebra , 1992 .
[13] P. R. Gillett,et al. To appear in Annals of Mathematics and Artificial Intelligence , 2000 .
[14] B. Bollobás. Surveys in Combinatorics , 1979 .
[15] Carsten Thomassen,et al. NOR)T).~ Finite Metric Spaces of Strictly Negative Type* , 1998 .
[16] Oliver Kullmann,et al. An application of matroid theory to the SAT problem , 2000, Proceedings 15th Annual IEEE Conference on Computational Complexity.
[17] Carsten Thomassen,et al. Finite metric spaces of strictly negative type , 1998 .
[18] Hans Kleine Büning,et al. Satisfiable Formulas Closed Under Replacement , 2001, Electron. Notes Discret. Math..
[19] Hans Kleine Büning,et al. On the structure of some classes of minimal unsatisfiable formulas , 2003, Discret. Appl. Math..
[20] Gordon F. Royle,et al. Algebraic Graph Theory , 2001, Graduate texts in mathematics.
[21] Stefan Szeider,et al. Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference , 2002, Theor. Comput. Sci..
[22] Stefan Szeider. Generalizations of matched CNF formulas , 2005, Annals of Mathematics and Artificial Intelligence.
[23] K. Brown,et al. Graduate Texts in Mathematics , 1982 .
[24] David A. Gregory,et al. Addressing the Petersen graph , 2002, Electron. Notes Discret. Math..
[25] Ronald L. Graham,et al. On the addressing problem for loop switching , 1971 .