نتایج جستجو برای: berman

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

Journal: :پژوهش ادبیات معاصر جهان 0

translation is an activity that crystalizes borders. in aworld with good translations, there are no borders but the wall is not made ofconcrete. there are boundaries but crystal walls that has emerged from the workof translators. in a world, where borders is inevitable translation is a way tocleanse borders of factious and desperate. if we translate in accordance to thetheory of antoine berman,...

Journal: :Advances in Mathematics 2021

We show that delta invariant is a continuous function on the big cone. will also introduce an analytic in terms of optimal exponent Moser–Trudinger inequality and prove it varies continuously Kähler cone, from which we deduce continuity greatest Ricci lower bound. Then building work Berman–Boucksom–Jonsson, obtain uniform Yau–Tian–Donaldson theorem for twisted Kähler–Einstein metrics transcende...

Journal: :Advances in pediatrics 2010
Julia Lynch Joe Wathen Eric Tham Patrick Mahar Stephen Berman

Julia Lynch, MD, Joe Wathen, MD, Eric Tham, MD, Patrick Mahar, MD, Stephen Berman, MD* Military Infectious Disease Research Program, US Army, Medical Research and Material Command (US Army, MRMC), 504 Scott Street, Fort Detrick, MA 21702, USA Department of Pediatrics, Emergency Medicine, University of Colorado, The Children’s Hospital, 13123 East 16th Avenue, B251, Aurora, CO 80045, USA Departm...

Journal: :J. Comb. Theory, Ser. B 2013
Guantao Chen Songling Shan

We show that if G is a graph such that every edge is in at least two triangles, then G contains a spanning tree with no vertex of degree 2 (a homeomorphically irreducible spanning tree). This result was originally asked in a question format by Albertson, Berman, Hutchinson, and Thomassen in 1979, and then conjectured to be true by Archdeacon in 2009. MSC2010 : 05C05, 05C75

Journal: :Theory of Computing 2012
Michael Lampis

The Traveling Salesman Problem is one of the most studied problems in computational complexity and its approximability has been a long standing open question. Currently, the best known inapproximability threshold known is 220 219 due to Papadimitriou and Vempala. Here, using an essentially different construction and also relying on the work of Berman and Karpinski on bounded occurrence CSPs, we...

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

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