Results 221 to 230 of about 1,094,424 (267)
Some of the next articles are maybe not open access.
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
The transcriptional complexity of the TFIIH complex
Trends in Genetics, 2003Mutations in some subunits of the basal DNA repair and transcription factor II H (TFIIH) are involved in several human genetic disorders. Transcription factor II H interacts with a variety of factors during transcription, including nuclear receptors, tissue-specific transcription factors, chromatin remodeling complexes and RNA, suggesting that, in ...
Mario, Zurita, Carlos, Merino
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
2011
This is the core chapter of this book, about the complexity of complexity. After all of the rethinking in the preceding chapters, we think we are able to present a different notion and concept of complexity that can lead to a new way of thinking in complexity. We intend to develop a way of thinking in complexity that goes beyond the complexity as taken
openaire +1 more source
This is the core chapter of this book, about the complexity of complexity. After all of the rethinking in the preceding chapters, we think we are able to present a different notion and concept of complexity that can lead to a new way of thinking in complexity. We intend to develop a way of thinking in complexity that goes beyond the complexity as taken
openaire +1 more source
Complexity, Complexities and Complex Knowledges
2017This discussion aims at exploring the consequences of the existence of different types of complexities in the study of socio-technical systems. We illustrate links between three different type of complexities, namely weak emergence in the sense of Bedau (2002), computational complexity and informational complexity.
openaire +1 more source