Results 61 to 70 of about 1,085,519 (269)
Lower bounds by Birkhoff interpolation
Journal of Complexity, 2017 In this paper we give lower bounds for the representation of real univariate polynomials as sums of powers of degree 1 polynomials. We present two families of polynomials of degree d such that the number of powers that are required in such a representation must be at least of order d. This is clearly optimal up to a constant factor.
Garcia-Marco, Ignacio, Koiran, Pascal
openaire +3 more sources
Lower bounds for local approximation [PDF]
Journal of the ACM, 2012 In the study of deterministic distributed algorithms, it is commonly assumed that each node has a unique O (log n )-bit identifier. We prove that for a general class of graph problems, local algorithms (constant-time distributed algorithms) do not need such identifiers: a port numbering and ...
Mika Göös +2 more
openaire +2 more sources
Bayesian Cramér-Rao Lower Bound for Magnetic Field-Based Localization
IEEE Access, 2022 In this paper, we show how to analyze the achievable position accuracy of magnetic localization based on Bayesian Cramér-Rao lower bounds and how to account for deterministic inputs in the bound.
Benjamin Siebler +2 more
doaj +1 more source
FEBS Letters, EarlyView.In this study, we found that human cervical‐derived adipocytes maintain intracellular iron level by regulating the expression of iron transport‐related proteins during adrenergic stimulation. Melanotransferrin is predicted to interact with transferrin receptor 1 based on in silico analysis.
Rahaf Alrifai +9 more
wiley +1 more source
A Time Lower Bound for Satisfiability
Theoretical Computer Science, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dieter van Melkebeek, Ran Raz
openaire +1 more source
A Lower Bound for Jumbled Indexing [PDF]
, 2020 In this paper we study lower bounds for a variant of jumbled-indexing problem: given an input string S on an alphabet Σ = {σ1, . . ., σλ}, store it in a data structure such that given frequencies f1, · · ·, fλ, one can find all the substrings S0 of S where the frequency of the character σi is fi, for 1 ≤ i ≤ λ.
Afshani, Peyman +3 more
openaire +2 more sources
A lower bound for approximating the Grundy number [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Graphs and ...
Guy Kortsarz
doaj +1 more source
FEBS Letters, EarlyView.Structural and biochemical characterisations show that the planar cell polarity (PCP) protein Inturned harbours a unique PDZ‐like domain that does not bind canonical PDZ‐binding motifs (PBMs) like that of another PCP protein Vangl2. In contrast, the apical‐basal polarity protein Scribble contains four PDZ domains that bind Vangl2, but one PDZ domain ...
Stephan Wilmes +4 more
wiley +1 more source
Structural insights into an engineered feruloyl esterase with improved MHET degrading properties
FEBS Letters, EarlyView.A feruloyl esterase was engineered to mimic key features of MHETase, enhancing the degradation of PET oligomers. Structural and computational analysis reveal how a point mutation stabilizes the active site and reshapes the binding cleft, expading substrate scope.
Panagiota Karampa +5 more
wiley +1 more source
On lower bounds for the L_2-discrepancy
Journal of Complexity, 2010 The L_2-discrepancy measures the irregularity of the distribution of a finite point set. In this note we prove lower bounds for the L_2 discrepancy of arbitrary N-point sets. Our main focus is on the two-dimensional case. Asymptotic upper and lower estimates of the L_2-discrepancy in dimension 2 are well-known and are of the sharp order sqrt(log N ...
Aicke Hinrichs, Lev Markhasin
openaire +3 more sources