The Set Packing problem is, given a collection of sets $${\mathcal S}$$ over ground set U}$$ , to find maximum that are pairwise disjoint. is among the most fundamental NP-hard optimization problems have been studied extensively in various computational regimes. focus this work on parameterized complexity, Parameterized (PSP): Given $$r \in {\mathbb N}$$ there $$ {\mathcal S}' \subseteq S}: |{\...

let h be an infinite--dimensional hilbert space and k(h) be the set of all compact operators on h. we will adopt spectral theorem for compact self-adjoint operators, to investigate of higher derivation and higher jordan derivation on k(h) associated with the following cauchy-jencen type functional equation 2f(frac{t+s}{2}+r)=f(t)+f(s)+2f(r) for all t,s,rin k(h).

A first-order expansion of the R-vector space structure on R does not define every compact subset of every Rn if and only if topological and Hausdorff dimension coincide on all closed definable sets. Equivalently, if A ⊆ Rk is closed and the Hausdorff dimension of A exceeds the topological dimension of A, then every compact subset of every Rn can be constructed from A using finitely many boolea...

Conjunctive Boolean queries are a fundamental operation in web search engines. These queries can be reduced to the problem of intersecting ordered sets of integers, where each set represents the documents containing one of the query terms. But there is tension between the desire to store the lists effectively, in a compressed form, and the desire to carry out intersection operations efficiently...

In the present paper, we study some properties of fuzzy norm of linear operators. At first the bounded inverse theorem on fuzzy normed linear spaces is investigated. Then, we prove Hahn Banach theorem, uniform boundedness theorem and closed graph theorem on fuzzy normed linear spaces. Finally the set of all compact operators on these spaces is studied.