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

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

Journal: :Bratislavske lekarske listy 2015
I Igbe E K Omogbai A O Oyekan

OBJECTIVES The aim of study was to determine the renal effects of glucose transporter 4 (GLUT4) in a hypertensive nephropathy rat model. BACKGROUND GLUT4 has been implicated in insulin resistance and hypertension in several animal models; however its role in hypertensive nephropathy still remains unclear. METHODS Hypertensive nephropathy was induced by Nω-nitro-L-arginine (L-NNA), a nitric ...

Journal: :SIAM J. Discrete Math. 2008
Noga Alon Michael Krivelevich Benny Sudakov

For a real c ≥ 1 and an integer n, let f(n, c) denote the maximum integer f so that every graph on n vertices contains an induced subgraph on at least f vertices in which the maximum degree is at most c times the minimum degree. Thus, in particular, every graph on n vertices contains a regular induced subgraph on at least f(n, 1) vertices. The problem of estimating f(n, 1) was posed long time a...

2016
Mrinal Kumar Ramprasad Saptharishi

In this paper, we show that there is a family of polynomials {Pn}, where Pn is a polynomial in n variables of degree at most d = O(log2 n), such that • Pn can be computed by linear sized homogeneous depth-5 circuits. • Pn can be computed by poly(n) sized non-homogeneous depth-3 circuits. • Any homogeneous depth-4 circuit computing Pn must have size at least nΩ( √ d). This shows that the paramet...

Journal: :CoRR 2017
Aaron Potechin Liu Yang

In this paper, we investigate property testing whether or not a degree d multivariate polynomial is a sum of squares or is far from a sum of squares. We show that if we require that the property tester always accepts YES instances and uses random samples, nΩ(d) samples are required, which is not much fewer than it would take to completely determine the polynomial. To prove this lower bound, we ...

2012
OLAF BEYERSDORFF NICOLA GALESI MASSIMO LAURIA ALEXANDER A. RAZBOROV

A general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [2007]. There the authors show important results on tree-like Parameterized Resolution—a parameterized version of classical Resolution—and their gap complexity theorem implies lower bounds for that system. The main result of the present paper significantly improves upon this by showing optimal...

2008
SILVIUS KLEIN

In this paper we consider the discrete one-dimensional Schrödinger operator with quasi-periodic potential vn = λv(x+nω). We assume that the frequency ω satisfies a strong Diophantine condition and that the function v belongs to a Gevrey class, and it satisfies a transversality condition. Under these assumptions we prove in the perturbative regime that for large disorder λ and for most frequenci...

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

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