Results 221 to 230 of about 1,562,922 (269)
Some of the next articles are maybe not open access.
Human Development, 2009
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, irregularity of arrangement, amount of material, irregularity of shape, incongruities) interrelated? Are these dimensions interrelated ?
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, irregularity of arrangement, amount of material, irregularity of shape, incongruities) interrelated? Are these dimensions interrelated ?
S, Kreitler, E, Zigler, H, Kreitler
openaire +2 more sources
On the complexity of communication complexity
Proceedings of the forty-first annual ACM symposium on Theory of computing, 2009We consider the following question: given a two-argument boolean function f, represented as an N x N binary matrix, how hard is it to determine the (deterministic) communication complexity of f?We address two aspects of this question. On the computational side, we prove that, under appropriate cryptographic assumptions (such as the intractability of ...
Eyal Kushilevitz, Enav Weinreb
openaire +1 more source
Complexities of complex contrast
SPIE Proceedings, 2012For the visual system, luminance contrast is a fundamental property of images, and is one of the main inputs of any simulation of visual processing. Many models intended to evaluate visual properties such as image discriminability compute perceived contrast by using contrast sensitivity functions derived from studies of human spatial vision.
Andrew M. Haun, Eli Peli
openaire +1 more source
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 ...
Oded Goldreich 0001 +2 more
openaire +2 more sources
2016
Given a string, what is its complexity? We survey what is known about the computational complexity of this problem, and describe several open questions.
openaire +1 more source
Given a string, what is its complexity? We survey what is known about the computational complexity of this problem, and describe several open questions.
openaire +1 more source
The complexity of measuring complexity
Kybernetes, 2013PurposeThe purpose of this paper is to present a reflection that can contribute to the discussion of the possibility, or not, of measuring the complexity of any given system.Design/methodology/approachThe reflection takes place considering three aspects: the first one, of an etymological character, with the purpose to specify the semantics of ...
openaire +1 more source
Complex signal processing is not-complex
The 2004 47th Midwest Symposium on Circuits and Systems, 2004. MWSCAS '04., 2004Wireless systems often make use of the quadrature relationship between pairs of signals to effectively cancel out-of-band and interfering in-band signal components. The understanding of these systems is often simplified by considering both the signals and system transfer functions as "complex" quantities.
openaire +1 more source
COMPLEXITY IN THE MAJOR HISTOCOMPATIBILITY COMPLEX
International Journal of Immunogenetics, 1992SUMMARYThe human major histocompatibility complex (MHC) is one of the most intensively studied regions of the human genome, containing over 70 known genes and spanning about 4 million base pairs (4Mbp) of DNA on chromosome 6p21.3 (Klein, 1986). It can be divided up into three regions: the class I region (telomeric), the class II region (centromeric ...
J, Trowsdale, R D, Campbell
openaire +2 more sources
SIAM Journal on Computing, 1991
Summary: The importance of reversal complexity as a basic computational resource has only been recognized in recent years. It is intimately connected to parallel time complexity and circuit depth. Some basic techniques necessary for establishing analogues of well-known theorems on space and time complexity are developed.
Jianer Chen, Chee-Keng Yap
openaire +2 more sources
Summary: The importance of reversal complexity as a basic computational resource has only been recognized in recent years. It is intimately connected to parallel time complexity and circuit depth. Some basic techniques necessary for establishing analogues of well-known theorems on space and time complexity are developed.
Jianer Chen, Chee-Keng Yap
openaire +2 more sources

