Mоlimо vаs kоristitе оvај idеntifikаtоr zа citirаnjе ili оvај link dо оvе stаvkе:
https://open.uns.ac.rs/handle/123456789/11698
Nаziv: | A characterization of Boolean collections of set-valued functions | Аutоri: | Reischer C. Simovici D. Stojmenović, Ivan Tošić, Ratko |
Dаtum izdаvаnjа: | 1-јан-1997 | Čаsоpis: | Information Sciences | Sažetak: | We consider functions on subsets of a finite element set r = {0,..., r - 1}. A small fraction of these functions are Boolean functions, i.e., functions that can be constructed from constants and variables, using union, intersection, and complementation. We introduce the notion of Boolean collection of sets, and explore several combinatorial aspects of these collections. A collection C is a set consisting of several n-tuples of subsets of r. We solve the following problem. Given n ≥ 1, characterize collections C for which there exists a Boolean function F: script P sign(r)n → script P sign(r) such that F(X1,...,Xn) = Ø if and only if (X1,..., Xn) ∈C, where X1,..., Xn ∈script P sign(r) and script P sign(r) is the set of subsets of r. © Elsevier Science Inc. 1997. | URI: | https://open.uns.ac.rs/handle/123456789/11698 | ISSN: | 00200255 | DOI: | 10.1016/S0020-0255(96)00213-7 |
Nаlаzi sе u kоlеkciјаmа: | Naučne i umetničke publikacije |
Prikаzаti cеlоkupаn zаpis stаvki
SCOPUSTM
Nаvоđеnjа
4
prоvеrеnо 12.08.2023.
Prеglеd/i stаnicа
4
Prоtеklа nеdеljа
3
3
Prоtеkli mеsеc
0
0
prоvеrеnо 03.05.2024.
Google ScholarTM
Prоvеritе
Аlt mеtrikа
Stаvkе nа DSpace-u su zаštićеnе аutоrskim prаvimа, sа svim prаvimа zаdržаnim, оsim аkо nije drugačije naznačeno.