Page 1 Next

Displaying 1 – 20 of 62

Showing per page

An upper bound on the space complexity of random formulae in resolution

Michele Zito (2002)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We prove that, with high probability, the space complexity of refuting a random unsatisfiable Boolean formula in k -CNF on n variables and m = Δ n clauses is O n · Δ - 1 k - 2 .

From two- to four-valued logic

Chris Brink (1993)

Banach Center Publications

The purpose of this note is to show that a known and natural four-valued logic co-exists with classical two-valued logic in the familiar context of truth tables. The tool required is the power construction.

Currently displaying 1 – 20 of 62

Page 1 Next