نتایج جستجو برای: lower bounds

تعداد نتایج: 741573  

Journal: :Journal of Pure and Applied Algebra 1997

Journal: :Theoretical Computer Science 1987

Journal: :Publications de l'Institut Mathematique 2008

Journal: :Games and Economic Behavior 2018

Journal: :Quantum Information and Computation 2011

Journal: :Information Processing Letters 1991

Journal: :Journal of Graph Algorithms and Applications 2006

Journal: :international journal of group theory 2013
ahmad erfanian mohammad farrokhi derakhshandeh ghouchan

‎let $g$ be a finite group and $d_2(g)$ denotes the probability ‎that $[x,y,y]=1$ for randomly chosen elements $x,y$ of $g$‎. ‎we ‎will obtain lower and upper bounds for $d_2(g)$ in the case where ‎the sets $e_g(x)={yin g:[y,x,x]=1}$ are subgroups of $g$ for ‎all $xin g$‎. ‎also the given examples illustrate that all the ‎bounds are sharp.

Let $F$ be a non-Archimedean locally compact field‎. ‎Let $sigma$ and $tau$ be finite-dimensional representations of the Weil-Deligne group of $F$‎. ‎We give strong upper and lower bounds for the Artin and Swan exponents of $sigmaotimestau$ in terms of those of $sigma$ and $tau$‎. ‎We give a different lower bound in terms of $sigmaotimeschecksigma$ and $tauotimeschecktau$‎. ‎Using the Langlands...

Journal: :Electronic Colloquium on Computational Complexity (ECCC) 2015
Shiteng Chen Periklis A. Papakonstantinou

We show that for any coprime m, r there is a circuit of the form MODm ◦ ANDd(n) whose correlation with MODr is at least 2 −O( n d(n) ). This is the first correlation lower bound for arbitrary m, r, whereas previously lower bounds were known for prime m. Our motivation is the question posed by Green et al. [11] to which the 2( n d(n) ) bound is a partial negative answer. We first show a 2−Ω(n) c...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید