Results 221 to 230 of about 5,383,965 (247)
Some of the next articles are maybe not open access.
Human Development, 1974
The study dealt with the following questions about the nature and effects of complexity in children: Are responses to stimuli exemplifying any of the complexity dimensions (heterogeneity of elements,
S, Kreitler, E, Zigler, H, Kreitler
openaire +2 more sources
The study dealt with the following questions about the nature and effects of complexity in children: Are responses to stimuli exemplifying any of the complexity dimensions (heterogeneity of elements,
S, Kreitler, E, Zigler, H, Kreitler
openaire +2 more sources
Groundwater, 2006
Abstract It is difficult to define complexity in modeling. Complexity is often associated with uncertainty since modeling uncertainty is an intrinsically difficult task. However, modeling uncertainty does not require, necessarily, complex models, in the sense of a model requiring an unmanageable number of degrees of freedom to ...
openaire +2 more sources
Abstract It is difficult to define complexity in modeling. Complexity is often associated with uncertainty since modeling uncertainty is an intrinsically difficult task. However, modeling uncertainty does not require, necessarily, complex models, in the sense of a model requiring an unmanageable number of degrees of freedom to ...
openaire +2 more sources
Science's STKE, 2002
When a cellular protein is no longer needed, a proteasomal complex is often used to degrade the unneeded protein. However, proteasomal subunits are now known to be active in nuclear excision repair and transcription elongation. Gonzalez et al. (see the Perspective by Ottosen et al.
+4 more sources
When a cellular protein is no longer needed, a proteasomal complex is often used to degrade the unneeded protein. However, proteasomal subunits are now known to be active in nuclear excision repair and transcription elongation. Gonzalez et al. (see the Perspective by Ottosen et al.
+4 more sources
Computational Complexity and Knowledge Complexity
SIAM Journal on Computing, 1998Summary: We study the computational complexity of languages which have interactive proofs of logarithmic knowledge complexity. We show that all such languages can be recognized in \({\mathcal {BPP}}^{\mathcal {NP}}\). Prior to this work, for languages with greater-than-zero knowledge complexity only trivial computational complexity bounds were known ...
Goldreich, Oded +2 more
openaire +1 more source
Chessboard Complexes and Matching Complexes
Journal of the London Mathematical Society, 1994The `chessboard complex' \(\Delta_{m,n}\) is the abstract simplicial complex given by all non-taking rook configurations on an \((m \times n)\)- chessboard. This complex is the fundamental structure behind quite distinct problems: it appears as the matching complex of a complete bipartite graph \(K_{m,n}\), a coset complex in the symmetric group, etc ...
Björner, A. +3 more
openaire +2 more sources
Evolutionary complexity of MADS complexes
Current Opinion in Plant Biology, 2007Developmental programs rely on the timely and spatially correct expression of sets of interacting factors, many of which appear to be transcription factors. Examples of these can be found in the MADS-box gene family. This gene family has greatly expanded, particularly in plants, by a range of duplications that have enabled the genes to diversify in ...
Rijpkema, A.S. +2 more
openaire +3 more sources