In the field of integrated circuits, computational cost has always been a crucial design metric. recent years, with continuous development in computing, requirements for computation have growing rapidly. Reducing and improving efficiency become key issues field. There are many error-tolerant applications multimedia where approximate computing techniques can be applied to improve reduce costs at...

We combine the fundamental results of Breuillard, Green, and Tao (Publ Math Inst Hautes Études Sci 116:115–221, 2012) on structure approximate groups, together with “tame” arithmetic regularity methods based work authors Terry (J Eur Soc (JEMS) 24(2):583–621, 2022), to give a theorem for finite subsets A arbitrary groups G where has “small tripling” bounded VC-dimension: Roughly speaking, up sm...

C is called a completely bounded multiplier (= Herz-Schur multiplier) if the transformation defined on the linear span K(G) of {λ(x), x ∈ G} by x∈G f (x)λ(x) → x∈G f (x)ϕ(x)λ(x) is completely bounded (in short c.b.) on the C *-algebra C * λ (G) which is generated by λ (C * λ (G) is the closure of K(G) in B(ℓ 2 (G), ℓ 2 (G)).) One of our main results (stated below as Theorem 0.1) gives a simple ...

let s be a locally compact topological foundation semigroup with identity and ma(s) be its semigroup algebra. in this paper, we give necessary and sufficient conditions to have abounded approximate identity in closed codimension one ideals of the semigroup algebra $m_a(s)$ of a locally compact topological foundationsemigroup with identity.

Let A be a Banach algebra with bounded approximate identity by 1. Two new topologies ?so and ?wo are introduced on A. We study these compare them each other the norm topology. The properties of then studied further we pay attention to group L1(G) locally compact G. Various necessary sufficient conditions found for G finite.

Two distributions over n-bit strings are (k, δ)-wise indistinguishable if no statistical test that observes k of the n bits can tell the two distributions apart with advantage better than δ. Motivated by secret sharing and cryptographic leakage resilience, we study the existence of pairs of distributions that are (k, δ)-wise indistinguishable, but can be distinguished by some function f of suit...

Signal processing and multimedia are among the best applications for imprecise computing. The use of precise computation in arithmetic circuits can deliver more useful results without consuming electricity. Using recursive multiplication by approximate multipliers form compressors, we propose a new design that takes advantage partitions partial products. An compression 4:2 is used to three mult...