Results 1 to 10 of about 3,701,882 (277)
Deriving Grover's lower bound from simple physical principles [PDF]
New Journal of Physics, 2016 Grover's algorithm constitutes the optimal quantum solution to the search problem and provides a quadratic speed-up over all possible classical search algorithms.
Ciarán M Lee, John H Selby
doaj +3 more sources
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016 A general and long-standing belief in the proof complexity community asserts that there is a close connection between progress in lower bounds for Boolean circuits and progress in proof size lower bounds for strong propositional proof systems. Although there are famous examples where a transfer from ideas and techniques from circuit complexity to proof
Olaf Beyersdorff +2 more
+4 more sources
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.
Hemaspaandra, Edith +2 more
openaire +2 more sources
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
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
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
Mathematics, 2023 In this paper, the authors review and survey some results published since 2020 about (complete) monotonicity, inequalities, and their necessary and sufficient conditions for several newly introduced functions involving polygamma functions and originating
Feng Qi, Ravi Prakash Agarwal
doaj +1 more source
Average Rate Analysis of Cooperative NOMA Aided Underwater Optical Wireless Systems
IEEE Open Journal of the Communications Society, 2021 In this paper, we consider a cooperative non-orthogonal multiple access (NOMA) aided underwater optical wireless system in which the source transmits to two users where the near user serves as a relay node to the far user. Our proposed system consists of
Kapila W. S. Palitharathna +4 more
doaj +1 more source
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