𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Tiling with Bars and Satisfaction of Boolean Formulas

✍ Scribed by Eric Rémila

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
246 KB
Volume
17
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tiling a simply connected figure with ba
Tiling a simply connected figure with bars of length 2 or 3
✍ Eric Rémila 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 510 KB

Let F be a simply connected figure formed from a finite set of cells of the planar square lattice. We first prove that if F has no peak (a peak is a cell of F which has three of its edges in the contour of F), then F can be tiled with rectangular bars formed from 2 or 3 cells. Afterwards, we devise

Some typical properties of large AND/OR
Some typical properties of large AND/OR Boolean formulas
✍ Hanno Lefmann; Petr Savický 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 195 KB

In this paper typical properties of large random Boolean ANDrOR formulas are investigated. Such formulas with n variables are viewed as rooted binary trees chosen from the uniform distribution of all rooted binary trees on m nodes, where n is fixed and m tends to infinity. The leaves are labeled by

The number of Boolean functions computed
The number of Boolean functions computed by formulas of a given size
✍ Petr Savický; Alan R. Woods 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 323 KB 👁 2 views

Estimates are given of the number B n, L of distinct functions computed by propositional formulas of size L in n variables, constructed using only literals and n, k Ž connectives. L is the number of occurrences of variables. L y 1 is the number of binary ns Ž . and ks. B n, L is also the number of f

The Number of Rhombus Tilings of a “Punc
The Number of Rhombus Tilings of a “Punctured” Hexagon and the Minor Summation Formula
✍ S Okada; C Krattenthaler 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 403 KB

We compute the number of all rhombus tilings of a hexagon with sides a, b q 1, c, a q 1, b, c q 1, of which the central triangle is removed, provided a, b, c , where B ␣ , ␤, ␥ is the number of plane partitions inside the ␣ = ␤ = ␥ box. The proof uses nonintersecting lattice paths and a new identit

Employee satisfaction with meetings: A c
Employee satisfaction with meetings: A contemporary facet of job satisfaction
✍ Steven G. Rogelberg; Joseph A. Allen; Linda Shanock; Cliff Scott; Marissa Shuffl 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB

## Abstract Given the ubiquity, time investment, and theoretical relevance of meetings to work attitudes, this study explored whether organizational science should consider employee satisfaction with meetings as a contemporary, important, and discrete facet of job satisfaction. Using affective even

Completions of BOOLEAN Algebras with ope
Completions of BOOLEAN Algebras with operators
✍ J. Donald Monk 📂 Article 📅 1970 🏛 John Wiley and Sons 🌐 English ⚖ 401 KB

The notion of a BooLEan algebra with operators was introduced by J~NSSON and TARSKI [ 5 ] . It encompasses as special cases relation algebras (TARSKI [9]), closure algebras (MCKINSEY-TARSKI [S]), cylindric algebras (HENRIN-TARSKI [4]), polyadic algebras (HALMOS [Z]), and other algebras which have be