Results 11 to 20 of about 23,418,736 (380)

The time complexity of self-assembly. [PDF]

open access: yesProc Natl Acad Sci U S A, 2022
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   +6 more sources

Time complexity and gate complexity [PDF]

open access: yesPhysical Review A, 2010
11 pages, 6 ...
Koike, Tatsuhiko, Okudaira, Yosuke
openaire   +3 more sources

Dynamical complexity of discrete-time regulatory networks [PDF]

open access: green, 2005
Genetic regulatory networks are usually modeled by systems of coupled differential equations and by finite state models, better known as logical networks, are also used.
Ricardo Lima, Edgardo Ugalde
openalex   +3 more sources

Taming Quantum Time Complexity [PDF]

open access: yesQuantum, 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

Space–time complexity in Hamiltonian dynamics [PDF]

open access: yesChaos: An Interdisciplinary Journal of Nonlinear Science, 2003
New notions of the complexity function C(ε;t,s) and entropy function S(ε;t,s) are introduced to describe systems with nonzero or zero Lyapunov exponents or systems that exhibit strong intermittent behavior with “flights,” trappings, weak mixing, etc.
Afraimovich, V., Zaslavsky, G. M.
openaire   +4 more sources

Complexity Leadership: On Time, On Budget [PDF]

open access: greenIEEE 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   +5 more sources

New Classes of Distributed Time Complexity [PDF]

open access: yesSymposium 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

On the Time Dependence of Holographic Complexity [PDF]

open access: yes, 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   +9 more sources

Efficient Maximum k-Defective Clique Computation with Improved Time Complexity [PDF]

open access: yesProc. ACM Manag. Data, 2023
k-defective cliques relax cliques by allowing up-to k missing edges from being a complete graph. This relaxation enables us to find larger near-cliques and has applications in link prediction, cluster detection, social network analysis and transportation
Lijun Chang
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy