Results 1 to 10 of about 22,781,989 (354)
The time complexity of self-assembly. [PDF]
Proc Natl Acad Sci U S A, 2022 Significance An important limiting factor for self-assembly processes is the time it takes to assemble large structures with high yield. While equilibrium self-assembly systems slowly relax toward a state of minimal free energy, nonequilibrium systems ...
Gartner FM, Graf IR, Frey E.
europepmc +2 more sources
Taming Quantum Time Complexity [PDF]
Quantum, 2023 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 +3 more sources
Span programs and quantum time complexity [PDF]
Proceedings of MFCS 2020, LIPIcs, vol. 170, pp. 26:1--26:14,
978-3-95977-159-7 (2020), 2020 Span programs are an important model of quantum computation due to their tight correspondence with quantum query complexity. For any decision problem $f$, the minimum complexity of a span program for $f$ is equal, up to a constant factor, to the quantum query complexity of $f$. Moreover, this correspondence is constructive.
A. Cornelissen +3 more
arxiv +2 more sources
New Classes of Distributed Time Complexity [PDF]
Symposium on the Theory of Computing, 2018 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 +2 more sources
MUSCLE: a multiple sequence alignment method with reduced time and space complexity [PDF]
BMC Bioinformatics, 2004 BackgroundIn a previous paper, we introduced MUSCLE, a new program for creating multiple alignments of protein sequences, giving a brief summary of the algorithm and showing MUSCLE to achieve the highest scores reported to date on four alignment accuracy
R. C. Edgar
openalex +2 more sources
A Complexity Measure for Continuous Time Quantum Algorithms [PDF]
, 2000 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 ...
B. Bollobás +11 more
core +4 more sources
On the Time Dependence of Holographic Complexity [PDF]
, 2017 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 +10 more sources
How Long It Takes for an Ordinary Node with an Ordinary ID to Output? [PDF]
arXiv, 2017 In the context of distributed synchronous computing, processors perform in rounds, and the time-complexity of a distributed algorithm is classically defined as the number of rounds before all computing nodes have output. Hence, this complexity measure captures the running time of the slowest node(s). In this paper, we are interested in the running time
A Korman +13 more
arxiv +3 more sources
Influence Maximization: Near-Optimal Time Complexity Meets Practical Efficiency [PDF]
SIGMOD Conference, 2014 Given a social network G and a constant k, the influence maximization problem asks for k nodes in G that (directly and indirectly) influence the largest number of nodes under a pre-defined diffusion model.
Shi, Yanchen, Tang, Youze, Xiao, Xiaokui
core +2 more sources
Entropic nonextensivity as a measure of time series complexity [PDF]
, 2004 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 ...
Cao +9 more
core +3 more sources