We investigate the complexity of Boolean clone membership problem (CMP): given a set functions $F$ and function $f$, determine if $f$ is in generated by $F$, i.e., it can be expressed circuit with $F$-gates. Here, elements are as circuits or formulas over usual De Morgan basis. B\"ohler Schnoor (2007) proved that for any fixed coNP-complete, few exceptions where P. Vollmer (2009) incorrectly cl...

In this paper, we present some common fixed point theorems for (ψ,φ)-generalized f -weakly contractive mappings in metric and ordered metric spaces. Our results extend, generalize and improve some well-known results in the literature. Also, we give an example to illustrate our results.

Abstract Given an inner function $$\theta $$ θ on the unit disk, let $$K^p_\theta :=H^p\cap \theta {\overline{z}}\overline{H^p}$$ K p : = H ∩ <mm...

the idea of difference sequences of real (or complex) numbers was introducedby ki zmaz cite{kizmaz}. in this paper, using the difference operator and alacunary sequence, we introduce and examine the class of sequence $bv_{theta}left(  delta,mathcal{f}right)  .$ we study some of its properties likesolidity, symmetricity, etc.

In this paper, we provide some generalizations of the Darbo's fixed point theorem and further develop notion $F$-contraction introduced by Wardowski in (\cite{wad}, D. Wardowski, \emph{Fixed points a new type contractive mappings complete metric spaces,} Fixed Point Theory Appl., 94, (2012)). To achieve this, introduce Darbo-type $F$-contraction, cyclic $(\alpha,\beta)$-admissible operator also...

We provide a solution to the problem of reconstructing a fractal interpolation function from its scale-space zeros. Every fractal interpolation function f has a graph that is the attractor of an iterated functions system deened by contractive maps w1; : : : ; wN. We construct approximations of these maps from ngerprints in scale-space.