Results 1 to 10 of about 6,618,541 (298)
Universal lower bound on orbital periods
European Physical Journal C: Particles and Fields, 2023 It is proved, using the curved line element of a spherically symmetric charged object in general relativity and the Schwinger discharge mechanism of quantum field theory, that the orbital periods $$T_{\infty }$$ T ∞ of test particles around central ...
Shahar Hod
doaj +1 more source
Symmetry-Like Relation of Relative Entropy Measure of Quantum Coherence
Entropy, 2020 Quantum coherence is an important physical resource in quantum information science, and also as one of the most fundamental and striking features in quantum physics. To quantify coherence, two proper measures were introduced in the literature, the one is
Chengyang Zhang, Zhihua Guo, Huaixin Cao
doaj +1 more source
A lower bound on web services composition [PDF]
Logical Methods in Computer Science, 2008 A web service is modeled here as a finite state machine. A composition problem for web services is to decide if a given web service can be constructed from a given set of web services; where the construction is understood as a simulation of the ...
Anca Muscholl, Igor Walukiewicz
doaj +1 more source
Option Pricing, Zero Lower Bound, and COVID-19
Risks, 2021 This paper provides a quantitative assessment of equity options priced at the Zero Lower Bound, i.e., when interest rates are set essentially to zero. We obtain closed form formulas for American options when the Zero Lower Bound policy holds.
Giacomo Morelli, Lea Petrella
doaj +1 more source
Raising NP lower bounds to parallel NP lower bounds [PDF]
ACM SIGACT News, 1997 This issue's column surveys recent progress in raising NP-hardness lower bounds to parallel NP lower bounds. Complexity theorists will learn that Lewis Carroll (unbeknownst to himself) was a fellow complexity theorist. So that readers specializing in algorithms don't feel left out, let me mention that they are in even better company.
Edith Hemaspaandra +2 more
openaire +4 more sources
A Lower Jackson Bound on (- ∞, ∞) [PDF]
Proceedings of the American Mathematical Society, 1970 We produce a lower bound for the degree of uniform polynomial approximation to continuous functions on the whole real line using the weight function exp
J. S. Byrnes, D. J. Newman
openaire +1 more source
Lower Bounds for QBFs of Bounded Treewidth [PDF]
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020 The problem of deciding the validity (QSAT) of quantified Boolean formulas (QBF) is a vivid research area in both theory and practice. In the field of parameterized algorithmics, the well-studied graph measure treewidth turned out to be a successful parameter.
Johannes Klaus Fichte +2 more
openaire +3 more sources
Bounds for blow-up time in a semilinear pseudo-parabolic equation with nonlocal source
Journal of Inequalities and Applications, 2016 This paper considers the following semilinear pseudo-parabolic equation with a nonlocal source: u t − △ u t − △ u = u p ( x , t ) ∫ Ω k ( x , y ) u p + 1 ( y , t ) d y , $$ u_{t}-\triangle u_{t}-\triangle u=u^{p}(x,t) \int_{\Omega}k(x,y)u^{p+1}(y,t)\,dy,
Yang Lu, Liang Fei
doaj +1 more source
Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317), 2001 The main result of the paper is that primality testing, gcd computation and square-free computation is not in \(AC^0\), that is, can not be accomplished by constant depth, polynomial-size circuits of AND, OR and NOT gates. The technique used by the authors is to reduce the functions that have circuit lower bound known to divisibility and then, using a ...
Eric Allender +2 more
openaire +5 more sources