Results 51 to 60 of about 96,047 (264)
Consistency of circuit lower bounds with bounded theories [PDF]
Logical Methods in Computer Science, 2020 Proving that there are problems in $\mathsf{P}^\mathsf{NP}$ that require boolean circuits of super-linear size is a major frontier in complexity theory. While such lower bounds are known for larger complexity classes, existing results only show that the ...
Jan Bydzovsky +2 more
doaj +1 more source
Lower bounds for Buchsbaum* complexes
European Journal of Combinatorics, 2011 The class of $(d-1)$-dimensional Buchsbaum* simplicial complexes is studied. It is shown that the rank-selected subcomplexes of a (completely) balanced Buchsbaum* simplicial complex are also Buchsbaum*. Using this result, lower bounds on the $h$-numbers of balanced Buchsbaum* simplicial complexes are established. In addition, sharp lower bounds on the $
Jonathan Browder, Steven Klee
openaire +3 more sources
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
Lower bounds on systolic gossip
Proceedings 11th International Parallel Processing Symposium, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
FLAMMINI, MICHELE, PERENNES S.
openaire +4 more sources
Shellings and the Lower Bound Theorem [PDF]
Discrete & Computational Geometry, 1999 A stacked \(d\)-polytope \(P_s\) is a simplicial polytope obtained from a simplex by successive addition of pyramids over facets. The number of \(k\)-faces \((1\leq k\leq d-1)\) of \(P_s\) is some function \(\varphi_k(n,d),\) where \(n\) is the vertex number of \(P_s.\) The lower bound theorem (LBT) asserts that for a simplicial \(d\)-polytope \(P ...
Gerd Blind, Roswitha Blind
openaire +1 more source
Lower bounds for the bandwidth problem
Computers & Operations Research, 2021 The Bandwidth Problem seeks for a simultaneous permutation of the rows and columns of the adjacency matrix of a graph such that all nonzero entries are as close as possible to the main diagonal. This work focuses on investigating novel approaches to obtain lower bounds for the bandwidth problem.
Franz Rendl +2 more
openaire +4 more sources
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
Open Mathematics, 2016 Some convergent sequences of the lower bounds of the minimum eigenvalue for the Hadamard product of a nonsingular M-matrix B and the inverse of a nonsingular M-matrix A are given by using Brauer’s theorem.
Zhao Jianxing, Sang Caili
doaj +1 more source
Scientific Reports, 2021 Ritz eigenvalues only provide upper bounds for the energy levels, while obtaining lower bounds requires at least the calculation of the variances associated with these eigenvalues. The well-known Weinstein and Temple lower bounds based on the eigenvalues
Miklos Ronto +2 more
doaj +1 more source
Tau acetylation at K331 has limited impact on tau pathology in vivo
FEBS Letters, EarlyView.We mapped tau post‐translational modifications in humanized MAPT knock‐in mice and in amyloid‐bearing double knock‐in mice. Acetylation within the repeat domain, particularly around K331, showed modest increases under amyloid pathology. To test functional relevance, we generated MAPTK331Q knock‐in mice.
Shoko Hashimoto +3 more
wiley +1 more source