𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Binary Relations: Finite Characterizations and Computational Complexity

✍ Scribed by Vicki Knoblauch

Publisher
Springer US
Year
2007
Tongue
English
Weight
131 KB
Volume
65
Category
Article
ISSN
0040-5833

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Binary Representations of Finite Fields
Binary Representations of Finite Fields and Their Application to Complexity Theory
✍ JΓΌrg Ganz πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 301 KB

Binary representations of finite fields are defined as an injective mapping from a finite field to l-tuples with components in Ν•0, 1Ν– where 0 and 1 are elements of the field itself. This permits one to study the algebraic complexity of a particular binary representation, i.e., the minimum number of

Cumulative default logic: Finite charact
Cumulative default logic: Finite characterization, algorithms, and complexity
✍ Georg Gottlob; Mingyi Zhang πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 959 KB

Brewka's Cumulative Default Logic (CDL), a new version of Reiter's default logic, puts emphasis on the joint consistency among the justifications of all applied defaults to obtain cumulativity. In this paper, a finite characterization of CDL extensions using sets of generating defaults is given. Fro