Results 1 to 10 of about 4,283,498 (237)
The time complexity of self-assembly. [PDF]
ABSTRACTTime efficiency of self-assembly is crucial for many biological processes. Moreover, with the advances of nanotechnology, time efficiency in artificial self-assembly becomes ever more important. While structural determinants and the final assembly yield are increasingly well understood, kinetic aspects concerning the time efficiency, however ...
Gartner FM, Graf IR, Frey E.
europepmc +7 more sources
Time complexity and gate complexity [PDF]
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
On the Time Dependence of Holographic Complexity [PDF]
We evaluate the full time dependence of holographic complexity in various eternal black hole backgrounds using both the complexity=action (CA) and the complexity=volume (CV) conjectures.
Carmi, Dean+4 more
core +11 more sources
A hierarchy for nondeterministic time complexity [PDF]
We prove the following theorem in this paper: For any real numbers r1, r2, 1 ...
Stephen Cook
openalex +3 more sources
Taming Quantum Time Complexity [PDF]
Quantum query complexity has several nice properties with respect to composition. First, bounded-error quantum query algorithms can be composed without incurring log factors through error reduction $exactness$.
Aleksandrs Belovs+2 more
doaj +5 more sources
New Classes of Distributed Time Complexity [PDF]
A number of recent papers -- e.g. Brandt et al. (STOC 2016), Chang et al. (FOCS 2016), Ghaffari & Su (SODA 2017), Brandt et al. (PODC 2017), and Chang & Pettie (FOCS 2017) -- have advanced our understanding of one of the most fundamental questions in ...
Balliu, Alkida+5 more
core +5 more sources
Complexity measure for continuous-time quantum algorithms [PDF]
We consider unitary dynamical evolutions on n qubits caused by time dependent pair-interaction Hamiltonians and show that the running time of a parallelized two-qubit gate network simulating the evolution is given by the time integral over the chromatic ...
Dominik Janzing, T. Beth
openalex +4 more sources
Entropic nonextensivity as a measure of time series complexity [PDF]
Information entropy is applied to the analysis of time series generated by dynamical systems. Complexity of a temporal or spatio-temporal signal is defined as the difference between the sum of entropies of the local linear regions of the trajectory ...
Milan Rajković
openalex +4 more sources
Time complexity of iterative-deepening-A∗
AbstractWe analyze the time complexity of iterative-deepening-A∗ (IDA∗). We first show how to calculate the exact number of nodes at a given depth of a regular search tree, and the asymptotic brute-force branching factor. We then use this result to analyze IDA∗ with a consistent, admissible heuristic function.
Richard E. Korf+2 more
openalex +3 more sources
Complexity Analysis of Environmental Time Series. [PDF]
Small, forested catchments are prototypes of terrestrial ecosystems and have been studied in several disciplines of environmental science over several decades. Time series of water and matter fluxes and nutrient concentrations from these systems exhibit a bewildering diversity of spatiotemporal patterns, indicating the intricate nature of processes ...
Lange H, Hauhs M.
europepmc +5 more sources