Báo cáo toán học: "On the size of minimal unsatisfiable formulas" pptx

... y 2l = true) will make the remaining clauses true. Next we prove the linear upper bound of number of clauses in minimal unsatisfiable 2-SAT formulas. Proposition 1. Minimal unsatisfiable 2-SAT formulas ... deletion of any edge makes it 2 colorable. In this analogy, minimal unsatisfiable formulas correspond to critically 3-chromatic hypergraphs. Therefore it is ∗ This resear...

Ngày tải lên: 07/08/2014, 21:21

... function, and the former is sharp in the sense that n log n is the true order of magnitude of the size of the largest dissociated subset of the set {0, 1} n . At the same time, the bound of Theorem ... every element of M, is a linear combination of the elements of Λ with the coefficients in {−1, 0, 1}. Hence, every subset sum of M is a linear combination...

Ngày tải lên: 08/08/2014, 14:23

... (mod 4), then H = H 1 = (k − 1)P 2 ∪ 1 4 (l − 3)C 4 ∪ P 5 . Furthermore, if G = F then Φ F ≺ Φ G and if G = H then Φ G ≺ Φ H . Proof. The proof of this theorem is similar to the proof of Theorem ... −m)!. Multiply all these choices to get the numerator of the right-hand side of (4.10). Divide this number of choices by the number of permutations of {1, . . . , rn} to...

Ngày tải lên: 07/08/2014, 21:20

... α(j) = 0, 0 ≤ j ≤ n. Then the solution of (4.4) and (4.5) is bounded if and only if the condition (5.5) is satisfied. Proof. The proof is immediate consequence from proof of Theorem 4.3 with Remark ... condition for the boundedness of all solutions of (1.1) and the scalar case of (1.1), respectively. The next result provides a sufficient condition for the boundedness of...

Ngày tải lên: 20/06/2014, 20:20

Ngày tải lên: 05/08/2014, 10:20

Ngày tải lên: 05/08/2014, 10:20

Ngày tải lên: 05/08/2014, 10:20

Ngày tải lên: 05/08/2014, 10:20

Ngày tải lên: 05/08/2014, 15:20

Ngày tải lên: 05/08/2014, 15:20