Results 21 to 30 of about 6,001,676 (290)

The Complex Macromolecular Complex [PDF]

open access: yesTrends in Biochemical Sciences, 2016
Trends in Biochemical Sciences (TiBS) has a lot to celebrate. Our 40th anniversary, a new design, a very special issue, and two spectacular series lined up for the rest of the year; yes, it is a good time to be a biochemist.
openaire   +2 more sources

Smoothed Complexity Theory [PDF]

open access: yes, 2012
Smoothed analysis is a new way of analyzing algorithms introduced by Spielman and Teng (J. ACM, 2004). Classical methods like worst-case or average-case analysis have accompanying complexity classes, like P and AvgP, respectively.
A. Bogdanov   +18 more
core   +3 more sources

Complex clients - complex systems? [PDF]

open access: yesSouth Pacific Journal of Psychology, 2001
I would like to start with a tale… Exposure 'Some time ago a clinical psychologist registrar noted, vexedly, that it was all very well knowing what her clients needed to do if they were to improve, but it was no use at all when they stubbornly refused to adopt or deploy such life enhancing strategies.
openaire   +2 more sources

Complexity and coherence [PDF]

open access: yes, 2012
Leslie Topp traces the emergence of the asylum mortuary as an architectural challenge. Drawing on new archival research, Complexity and Coherence: The Challenge of the Asylum Mortuary in Central Europe, 1898–1908 unpacks the highly fraught combination of
Topp, Leslie
core   +1 more source

Time complexity and gate complexity

open access: yes, 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   +1 more source

Complexity in Complex Analysis

open access: yesAdvances in Mathematics, 2002
30 pages, to appear in Advances in ...
openaire   +3 more sources

Algorithms and Bounds for Very Strong Rainbow Coloring

open access: yes, 2018
A well-studied coloring problem is to assign colors to the edges of a graph $G$ so that, for every pair of vertices, all edges of at least one shortest path between them receive different colors.
Algorithms and Complexity   +8 more
core   +1 more source

Hamiltonian complexity

open access: yes, 2011
In recent years we've seen the birth of a new field known as hamiltonian complexity lying at the crossroads between computer science and theoretical physics.
Osborne, Tobias J.
core   +1 more source

Consciousness complexity [PDF]

open access: yes, 2015
Copyright © 2015 by author and Scientific Research Publishing Inc. This work is licensed under the Creative Commons Attribution International License (CC BY).
Osman, M
core   +1 more source

Shape Complexity in Turbulence [PDF]

open access: yes, 1998
The shape complexity of irregular surfaces is quantified by a dimensionless area-volume measure. A joint distribution of shape complexity and size is found for level-set islands and lakes in two-dimensional slices of the scalar field of liquid-phase ...
Catrakis, Haris J., Dimotakis, Paul E.
core   +1 more source

Home - About - Disclaimer - Privacy