Results 11 to 20 of about 22,856,606 (379)
Time complexity and gate complexity [PDF]
Physical Review A, 2010 We formulate and investigate the simplest version of time-optimal quantum computation theory (t-QCT), where the computation time is defined by the physical one and the Hamiltonian contains only one- and two-qubit interactions.
D. J. Tannor +5 more
core +2 more sources
A hierarchy for nondeterministic time complexity [PDF]
Journal of Computer and System Sciences, 1972 We prove the following theorem in this paper: For any real numbers r1, r2, 1 ...
Stephen Cook
openalex +4 more sources
Space-Time Complexity in Hamiltonian Dynamics [PDF]
Chaos: An Interdisciplinary Journal of Nonlinear Science, 2003 New notions of the complexity function C(epsilon;t,s) and entropy function S(epsilon;t,s) are introduced to describe systems with nonzero or zero Lyapunov exponents or systems that exhibit strong intermittent behavior with ``flights'', trappings, weak ...
Brudno A. A. +7 more
core +5 more sources
Time complexity of iterative-deepening-A∗
Artificial Intelligence, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Richard E. Korf +2 more
openalex +4 more sources
Complexity Leadership: On Time, On Budget [PDF]
IEEE Engineering Management Review, 2022 A discursive piece aimed at practitioners in Engineering Management. On the subject of Complexity Leadership and KPIs, this short article presents three models which expand on the work of Uhl-Bien and Marion (2007) by focusing on Administrative, Enabling and Adaptive Leaderships for managing complexity.<div><br></div>
Chris Biggadike +2 more
openaire +3 more sources
Time Complexity of In-Memory Solution of Linear Systems [PDF]
IEEE Transactions on Electron Devices, 2020 In-memory computing (IMC) with cross-point resistive memory arrays has been shown to accelerate data-centric computations, such as the training and inference of deep neural networks, due to the high parallelism endowed by physical rules in the electrical
Zhong Sun +5 more
semanticscholar +1 more source
Almost Optimal Searching of Maximal Subrepetitions in a Word
Mathematics, 2022 For some fixed δ such that ...
Roman Kolpakov
doaj +1 more source
Physical Review D, 2020 For any quantum algorithm given by a path in the space of unitary operators we define the computational complexity as the typical computational time associated with the path. This time is defined using a quantum time estimator associated with the path.
openaire +4 more sources
Performance Testing Technique for Applied Programs [PDF]
مجلة جامعة الانبار للعلوم الصرفة, 2012 In this paper, software was preparedto use for measuring the programs performance because of the importance of measuring the programs performance. The performance of any program basically depends on spent time and storing area needed to implement any ...
Falath M. Mohammad, Mortadha M. Hamad
doaj +1 more source
Complex-barrier tunnelling times [PDF]
Journal de Physique I, 1994 In this paper we calculate the analytic expression of the phase time for the scattering of an electron off a complex square barrier. As is well known the (negative) imaginary part of the potential takes into account, phenomenologically, the absorption. We investigate the so-called Hartman-Fletcher effect, and find that it is suppressed by the presence ...
RACITI, Fabio, SALESI G.
openaire +6 more sources